Base | Representation |
---|---|
bin | 1101110010001000110011… |
… | …11111001101110101100111 |
3 | 10222022121110102102012021222 |
4 | 12321010121333031311213 |
5 | 12433044410133210043 |
6 | 144244121524130555 |
7 | 6245553361606061 |
oct | 671043177156547 |
9 | 128277412365258 |
10 | 30310020210023 |
11 | 9726453256464 |
12 | 3496350536a5b |
13 | 13bb2b81b31c8 |
14 | 76b0271d2731 |
15 | 378676ed8d68 |
hex | 1b9119fcdd67 |
30310020210023 has 8 divisors (see below), whose sum is σ = 30317286787200. Its totient is φ = 30302754091768.
The previous prime is 30310020210013. The next prime is 30310020210079. The reversal of 30310020210023 is 32001202001303.
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 30310020210023 - 214 = 30310020193639 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30310020209983 and 30310020210010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30310020210013) 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, 157326488 + ... + 157519026.
It is an arithmetic number, because the mean of its divisors is an integer number (3789660848400).
Almost surely, 230310020210023 is an apocalyptic number.
30310020210023 is a deficient number, since it is larger than the sum of its proper divisors (7266577177).
30310020210023 is a wasteful number, since it uses less digits than its factorization.
30310020210023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 229461.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 30310020210023 its reverse (32001202001303), we get a palindrome (62311222211326).
The spelling of 30310020210023 in words is "thirty trillion, three hundred ten billion, twenty million, two hundred ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •