Base | Representation |
---|---|
bin | 110100010111010101100100… |
… | …001111010011001011010010 |
3 | 1010012102200000221021001201220 |
4 | 310113111210033103023102 |
5 | 220141232222004023442 |
6 | 2133451200151305510 |
7 | 66336531206050626 |
oct | 6427254417231322 |
9 | 1105380027231656 |
10 | 230302123111122 |
11 | 67421644594497 |
12 | 219b611707b296 |
13 | 9b6752134a0aa |
14 | 40c297a097186 |
15 | 1b95a47b06eec |
hex | d175643d32d2 |
230302123111122 has 16 divisors (see below), whose sum is σ = 473053009634112. Its totient is φ = 74692580468400.
The previous prime is 230302123111079. The next prime is 230302123111183. The reversal of 230302123111122 is 221111321203032.
230302123111122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 230302123111092 and 230302123111101.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 518698475254 + ... + 518698475697.
It is an arithmetic number, because the mean of its divisors is an integer number (29565813102132).
Almost surely, 2230302123111122 is an apocalyptic number.
230302123111122 is an abundant number, since it is smaller than the sum of its proper divisors (242750886522990).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230302123111122 is a wasteful number, since it uses less digits than its factorization.
230302123111122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1037396950993.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 230302123111122 its reverse (221111321203032), we get a palindrome (451413444314154).
The spelling of 230302123111122 in words is "two hundred thirty trillion, three hundred two billion, one hundred twenty-three million, one hundred eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •