Base | Representation |
---|---|
bin | 10111001101110010000110… |
… | …000001100000010100110011 |
3 | 111101111212122122101100020021 |
4 | 113031302012001200110303 |
5 | 101340320312020231003 |
6 | 1001053035214224311 |
7 | 30335432654524330 |
oct | 2715620601402463 |
9 | 441455578340207 |
10 | 102102211102003 |
11 | 2a595339405792 |
12 | b550113ab5097 |
13 | 44c8274307718 |
14 | 1b2dab824d987 |
15 | bc0da5b982bd |
hex | 5cdc86060533 |
102102211102003 has 8 divisors (see below), whose sum is σ = 116690302941440. Its totient is φ = 87514634683080.
The previous prime is 102102211101929. The next prime is 102102211102009. The reversal of 102102211102003 is 300201112201201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102102211102003 - 225 = 102102177547571 is a prime.
It is a super-2 number, since 2×1021022111020032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102102211102009) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 128430543 + ... + 129223096.
It is an arithmetic number, because the mean of its divisors is an integer number (14586287867680).
Almost surely, 2102102211102003 is an apocalyptic number.
102102211102003 is a deficient number, since it is larger than the sum of its proper divisors (14588091839437).
102102211102003 is an equidigital number, since it uses as much as digits as its factorization.
102102211102003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 257710257.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 102102211102003 its reverse (300201112201201), we get a palindrome (402303323303204).
The spelling of 102102211102003 in words is "one hundred two trillion, one hundred two billion, two hundred eleven million, one hundred two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •