12770
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 23004
- Proper Divisor Sum (Aliquot Sum)
- 10234
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5104
- Möbius Function
- -1
- Radical
- 12770
- Omega Function (Ω)
- 3
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 125
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- a(n) = prime(n)^2 + 1.at n=29A066872
- Even elements of A082931.at n=41A082933
- Number of base 30 circular n-digit numbers with adjacent digits differing by 4 or less.at n=4A125367
- Least K such that K*(prime(100*n)^(100*n))-1 is prime with prime(n)=n-th prime.at n=7A129245
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (0, 0, 1), (0, 1, -1), (1, 0, -1), (1, 1, 1)}.at n=7A150923
- a(n) = 81*n^2 - 72*n + 17.at n=13A154277
- Number of (w,x,y,z) with all terms in {0,...,n} and 2w-x=max{w,x,y,z}-min{w,x,y,z}.at n=29A212756
- Volume of sphere (rounded down) with the diameter equal to n.at n=28A228272
- The smallest numbers of every class in a classification of positive numbers (see comment).at n=31A247395
- 4-step Fibonacci sequence starting with 1, 1, 0, 1.at n=17A251704
- Bihappy numbers: numbers that reach 1 under iteration of the sum-of-squares-of-two-digits map s_2.at n=42A257795
- Numbers n which are both happy (A007770) and bihappy (A257795) numbers.at n=23A257950
- G.f.: 1/((1-t^8)*(1-t)*(1-t^3)*(1-t^5)*(1-t^7)*(1-t^9)*(1-t^11)*(1-t^13)*(1-t^15)).at n=64A266748
- Sequence satisfies: 1 = Sum_{n>=1} 2^(n*(n-1)) / a(n)^n, with a(1) = 2, by a greedy algorithm.at n=9A301804
- Numbers k such that k^2 reversed is a prime and k^2+(k^2 reversed) is a prime.at n=40A306301
- Number of nX2 0..1 arrays with every element unequal to 1, 2, 3 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=7A318062
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 1, 2, 3 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=37A318068
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 1, 2, 3 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=43A318068
- Number of triangles in the graph formed by drawing the lines connecting any two of the 2*(n+2) perimeter points of a 3 X (n+1) rectangular grid of points (or equally, a 2 X n grid of squares).at n=16A332606
- Irregular triangle read by rows: consider the structure formed by drawing the lines connecting any two of the 2*(n+2) perimeter points of an (n+1) X 3 rectangular grid of points (or equally, an n X 2 grid of squares); row n gives number of cells with k sides, for k >= 3.at n=58A335701