Base | Representation |
---|---|
bin | 110100010111010101101001… |
… | …000000110110100100111010 |
3 | 1010012102200020111222111210120 |
4 | 310113111221000312210322 |
5 | 220141232403010210132 |
6 | 2133451212132154110 |
7 | 66336533200635315 |
oct | 6427255100664472 |
9 | 1105380214874716 |
10 | 230302203210042 |
11 | 67421685822a47 |
12 | 219b6139a68936 |
13 | 9b67534b134c2 |
14 | 40c298698797c |
15 | 1b95a4eb7a02c |
hex | d1756903693a |
230302203210042 has 64 divisors (see below), whose sum is σ = 472391136000000. Its totient is φ = 74807381416320.
The previous prime is 230302203210041. The next prime is 230302203210047. The reversal of 230302203210042 is 240012302203032.
It is a junction number, because it is equal to n+sod(n) for n = 230302203209994 and 230302203210021.
It is not an unprimeable number, because it can be changed into a prime (230302203210041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 736983033 + ... + 737295459.
It is an arithmetic number, because the mean of its divisors is an integer number (7381111500000).
Almost surely, 2230302203210042 is an apocalyptic number.
230302203210042 is an abundant number, since it is smaller than the sum of its proper divisors (242088932789958).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230302203210042 is a wasteful number, since it uses less digits than its factorization.
230302203210042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 315971.
The product of its (nonzero) digits is 3456, while the sum is 24.
Adding to 230302203210042 its reverse (240012302203032), we get a palindrome (470314505413074).
The spelling of 230302203210042 in words is "two hundred thirty trillion, three hundred two billion, two hundred three million, two hundred ten thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •