Base | Representation |
---|---|
bin | 1101011010000011001… |
… | …1110110010101000011 |
3 | 211000112011210221212020 |
4 | 3112200303312111003 |
5 | 12233204242304443 |
6 | 253451313132523 |
7 | 22432552002534 |
oct | 3264063662503 |
9 | 730464727766 |
10 | 230331213123 |
11 | 89756a68590 |
12 | 3878155a143 |
13 | 189491c026b |
14 | b21050668b |
15 | 5ed11c5583 |
hex | 35a0cf6543 |
230331213123 has 32 divisors (see below), whose sum is σ = 353192804352. Its totient is φ = 132217303200.
The previous prime is 230331213121. The next prime is 230331213127. The reversal of 230331213123 is 321312133032.
230331213123 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 230331213123 - 21 = 230331213121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 230331213093 and 230331213102.
It is not an unprimeable number, because it can be changed into a prime (230331213121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2347161 + ... + 2443322.
It is an arithmetic number, because the mean of its divisors is an integer number (11037275136).
Almost surely, 2230331213123 is an apocalyptic number.
230331213123 is a deficient number, since it is larger than the sum of its proper divisors (122861591229).
230331213123 is a wasteful number, since it uses less digits than its factorization.
230331213123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4790575.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 230331213123 its reverse (321312133032), we get a palindrome (551643346155).
The spelling of 230331213123 in words is "two hundred thirty billion, three hundred thirty-one million, two hundred thirteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •