Base | Representation |
---|---|
bin | 10111001100100101110100… |
… | …010110011110110010001011 |
3 | 111101020001020211110002002010 |
4 | 113030211310112132302023 |
5 | 101333000043404412303 |
6 | 1000551252234311003 |
7 | 30326503251601266 |
oct | 2714456426366213 |
9 | 441201224402063 |
10 | 102020310232203 |
11 | 2a56363050a030 |
12 | b538277588463 |
13 | 44c062142619c |
14 | 1b29b48c61cdd |
15 | bbdbb0898c03 |
hex | 5cc97459ec8b |
102020310232203 has 8 divisors (see below), whose sum is σ = 148393178519616. Its totient is φ = 61830491049800.
The previous prime is 102020310232177. The next prime is 102020310232219. The reversal of 102020310232203 is 302232013020201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102020310232203 - 29 = 102020310231691 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102020310232203.
It is not an unprimeable number, because it can be changed into a prime (102020310232223) 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, 1545762276213 + ... + 1545762276278.
It is an arithmetic number, because the mean of its divisors is an integer number (18549147314952).
Almost surely, 2102020310232203 is an apocalyptic number.
102020310232203 is a deficient number, since it is larger than the sum of its proper divisors (46372868287413).
102020310232203 is a wasteful number, since it uses less digits than its factorization.
102020310232203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3091524552505.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 102020310232203 its reverse (302232013020201), we get a palindrome (404252323252404).
The spelling of 102020310232203 in words is "one hundred two trillion, twenty billion, three hundred ten million, two hundred thirty-two thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.604 sec. • engine limits •