Base | Representation |
---|---|
bin | 101111100010111000… |
… | …0001110100101011010 |
3 | 100202112122221002221000 |
4 | 1133011300032211122 |
5 | 3133101103031020 |
6 | 114523252125430 |
7 | 10243116461151 |
oct | 1370560164532 |
9 | 322478832830 |
10 | 102102002010 |
11 | 3a334a11348 |
12 | 17955906876 |
13 | 982214b908 |
14 | 4d282ac598 |
15 | 29c8a4a090 |
hex | 17c5c0e95a |
102102002010 has 64 divisors (see below), whose sum is σ = 281660716800. Its totient is φ = 26288329536.
The previous prime is 102102001997. The next prime is 102102002021. The reversal of 102102002010 is 10200201201.
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 = 102102001983 and 102102002001.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6512094 + ... + 6527753.
It is an arithmetic number, because the mean of its divisors is an integer number (4400948700).
Almost surely, 2102102002010 is an apocalyptic number.
102102002010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102102002010 is an abundant number, since it is smaller than the sum of its proper divisors (179558714790).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102102002010 is a wasteful number, since it uses less digits than its factorization.
102102002010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13039892 (or 13039886 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 102102002010 its reverse (10200201201), we get a palindrome (112302203211).
The spelling of 102102002010 in words is "one hundred two billion, one hundred two million, two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •