Base | Representation |
---|---|
bin | 10111010000101100011100… |
… | …110110010101111101100011 |
3 | 111102020000010212211011002010 |
4 | 113100230130312111331203 |
5 | 101402110112331444303 |
6 | 1001325011000524003 |
7 | 30356045416413552 |
oct | 2720543466257543 |
9 | 442200125734063 |
10 | 102302310031203 |
11 | 2a662190aa6957 |
12 | b582a58780603 |
13 | 45110b2c83b89 |
14 | 1b3965b523d99 |
15 | bc61b7b5ec03 |
hex | 5d0b1cd95f63 |
102302310031203 has 8 divisors (see below), whose sum is σ = 136698965249616. Its totient is φ = 68053597416800.
The previous prime is 102302310031111. The next prime is 102302310031211. The reversal of 102302310031203 is 302130013203201.
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 102302310031203 - 226 = 102302242922339 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102302310031203.
It is not an unprimeable number, because it can be changed into a prime (102302310031253) 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, 36985649388 + ... + 36985652153.
It is an arithmetic number, because the mean of its divisors is an integer number (17087370656202).
Almost surely, 2102302310031203 is an apocalyptic number.
102302310031203 is a deficient number, since it is larger than the sum of its proper divisors (34396655218413).
102302310031203 is an equidigital number, since it uses as much as digits as its factorization.
102302310031203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 73971302005.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 102302310031203 its reverse (302130013203201), we get a palindrome (404432323234404).
The spelling of 102302310031203 in words is "one hundred two trillion, three hundred two billion, three hundred ten million, thirty-one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •