102
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 3
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 216
- Proper Divisor Sum (Aliquot Sum)
- 114
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 32
- Möbius Function
- -1
- Radical
- 102
- 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
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 25
- Smith 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
Names
- German
- einshundertzwei· ordinal: einshundertzweiste
- English
- one hundred two· ordinal: one hundred second
- Spanish
- ciento dos· ordinal: 102º
- French
- cent deux· ordinal: cent deuxième
- Italian
- centodue· ordinal: 102º
- Latin
- centum duo· ordinal: 102.
- Portuguese
- cento e dois· ordinal: 102º
Appears in sequences
- Let k = p_1^e_1 p_2^e_2 p_3^e_3 ... be the prime factorization of n. Sequence gives k such that the sum of the numbers of 1's in the binary expansions of e_1, e_2, e_3, ... is odd.at n=47A000028
- Numbers k such that (2k)^4 + 1 is prime.at n=29A000059
- a(8i+j) = 13i + a(j), where 1<=j<=8.at n=62A000202
- 3*n - 2*floor(sqrt(4*n+5)) + 5.at n=41A000277
- Numbers that are the sum of three nonzero squares.at n=67A000408
- Numbers that are the sum of 3 but no fewer nonzero squares.at n=42A000419
- n written in base where place values are positive cubes.at n=29A000433
- Numbers written in base of triangular numbers.at n=7A000462
- 1 together with products of 2 or more distinct primes.at n=36A000469
- Number of steps to reach 1 in sequence A000546.at n=27A000547
- Number of steps to reach 1 in sequence A000546.at n=29A000547
- Number of nonnegative solutions of x^2 + y^2 = z in first n shells.at n=49A000592
- Number of tertiary alcohols (alkanols or alkyl alcohols C_n H_{2n+1} OH) with n carbon atoms.at n=10A000600
- Expansion of 1/((1-x)^2*(1-x^2)*(1-x^3)).at n=12A000601
- Number of partitions of n, with two kinds of 1, 2, 3 and 4.at n=7A000710
- Total number of 1's in binary expansions of 0, ..., n.at n=40A000788
- a(n) = floor(2^n / n).at n=9A000799
- Numbers beginning with a vowel in English.at n=16A000852
- Numbers ending with a vowel in American English.at n=48A000861
- Numbers beginning with letter 'o' in English.at n=3A000865