Base | Representation |
---|---|
bin | 10111001110001100001010… |
… | …011010011011011110000010 |
3 | 111101121112220101020220200100 |
4 | 113032030022122123132002 |
5 | 101341300123210011002 |
6 | 1001113544521103230 |
7 | 30340443420514254 |
oct | 2716141232333602 |
9 | 441545811226610 |
10 | 102130202032002 |
11 | 2a5a61a2577791 |
12 | b555626027b16 |
13 | 44caab539acb1 |
14 | 1b311b191bcd4 |
15 | bc199321c11c |
hex | 5ce30a69b782 |
102130202032002 has 96 divisors (see below), whose sum is σ = 239045551355520. Its totient is φ = 31414937045760.
The previous prime is 102130202031917. The next prime is 102130202032039. The reversal of 102130202032002 is 200230202031201.
102130202032002 is a `hidden beast` number, since 1 + 0 + 21 + 302 + 0 + 20 + 320 + 0 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 21615843 + ... + 25913414.
It is an arithmetic number, because the mean of its divisors is an integer number (2490057826620).
Almost surely, 2102130202032002 is an apocalyptic number.
102130202032002 is an abundant number, since it is smaller than the sum of its proper divisors (136915349323518).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102130202032002 is a wasteful number, since it uses less digits than its factorization.
102130202032002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47529448 (or 47529445 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 102130202032002 its reverse (200230202031201), we get a palindrome (302360404063203).
The spelling of 102130202032002 in words is "one hundred two trillion, one hundred thirty billion, two hundred two million, thirty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •