Base | Representation |
---|---|
bin | 10111001111001111111110… |
… | …001011110111101110001010 |
3 | 111101212111211120210122001010 |
4 | 113033033332023313232022 |
5 | 101343443231400124002 |
6 | 1001211225405104350 |
7 | 30345631616410656 |
oct | 2717177613675612 |
9 | 441774746718033 |
10 | 102203011333002 |
11 | 2a62406551a218 |
12 | b5677658580b6 |
13 | 450491984b218 |
14 | 1b3491b699a66 |
15 | bc38052a346c |
hex | 5cf3fe2f7b8a |
102203011333002 has 16 divisors (see below), whose sum is σ = 204406263114912. Its totient is φ = 34067630369520.
The previous prime is 102203011332977. The next prime is 102203011333009. The reversal of 102203011333002 is 200333110302201.
It is a self number, because there is not a number n which added to its sum of digits gives 102203011333002.
It is not an unprimeable number, because it can be changed into a prime (102203011333009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4236324 + ... + 14911487.
It is an arithmetic number, because the mean of its divisors is an integer number (12775391444682).
Almost surely, 2102203011333002 is an apocalyptic number.
102203011333002 is an abundant number, since it is smaller than the sum of its proper divisors (102203251781910).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102203011333002 is a wasteful number, since it uses less digits than its factorization.
102203011333002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20037413.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 102203011333002 its reverse (200333110302201), we get a palindrome (302536121635203).
The spelling of 102203011333002 in words is "one hundred two trillion, two hundred three billion, eleven million, three hundred thirty-three thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •