Base | Representation |
---|---|
bin | 101111011111111001… |
… | …0110010111101101010 |
3 | 100202021200210002102200 |
4 | 1132333302302331222 |
5 | 3132400003341020 |
6 | 114505321041030 |
7 | 10240463540133 |
oct | 1367762627552 |
9 | 322250702380 |
10 | 102002012010 |
11 | 3a293527388 |
12 | 17928326176 |
13 | 980750c832 |
14 | 4d18cc0c8a |
15 | 29bed98590 |
hex | 17bfcb2f6a |
102002012010 has 24 divisors (see below), whose sum is σ = 265205231460. Its totient is φ = 27200536512.
The previous prime is 102002012009. The next prime is 102002012017. The reversal of 102002012010 is 10210200201.
It can be written as a sum of positive squares in 2 ways, for example, as 95683192929 + 6318819081 = 309327^2 + 79491^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 102002011983 and 102002012001.
It is not an unprimeable number, because it can be changed into a prime (102002012017) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 566677755 + ... + 566677934.
Almost surely, 2102002012010 is an apocalyptic number.
102002012010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102002012010 is an abundant number, since it is smaller than the sum of its proper divisors (163203219450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102002012010 is a wasteful number, since it uses less digits than its factorization.
102002012010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1133355702 (or 1133355699 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 102002012010 its reverse (10210200201), we get a palindrome (112212212211).
The spelling of 102002012010 in words is "one hundred two billion, two million, twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •