14922
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 32370
- Proper Divisor Sum (Aliquot Sum)
- 17448
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4968
- Möbius Function
- 0
- Radical
- 4974
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 71
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Number of positive integers <= 2^n of form 5 x^2 + 10 y^2.at n=18A054180
- Numbers which are the sum of their proper divisors containing the digit 4.at n=27A059463
- Numbers which are the sum of their proper divisors containing the digit 7.at n=20A059466
- Pseudo-random numbers: gcc 2.6.3 version for 32-bit integers.at n=14A084276
- Records in A087029.at n=7A186443
- Number of lunar divisors (A087029) of the decimal numbers 1, 10, 11, 100, 101, 110, 111, 1000, ... .at n=29A186508
- Number of lunar divisors (in base 10) of the n-th nonzero number whose decimal expansion contains only 0's and 1's (A007088(n)).at n=29A186951
- a(n) = binary code (shown here in decimal) of the position of natural number n in the beanstalk-tree A218776.at n=33A218615
- a(n) = binary code (shown here in decimal) of the position of the predecessor of the natural number pair (2n,2n+1) in the compact beanstalk-tree A218780.at n=17A218791
- a(n) = 8*n^2 + 3*n + 1.at n=43A236267
- Indices of zeros in A269783.at n=46A269967
- p-INVERT of (0,1,0,1,0,1,...), where p(S) = 1 - 2 S - 2 S^2.at n=8A291228
- Irregular table read by rows: T(n,k) is the number of k-gons, k>=2, in the Farey Ring graph FR(n) defined in A359116.at n=40A359119
- Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of e.g.f. B(x)^k, where B(x) is the e.g.f. of A162659.at n=33A380178
- Consecutive states of the linear congruential pseudo-random number generator (1291*s + 4621) mod 21870 when started at s=1.at n=11A385337