Base | Representation |
---|---|
bin | 100100101111101011110010… |
… | …1110110001110001010001011 |
3 | 1120101101212022210102211201001 |
4 | 1021133113211312032022023 |
5 | 314331010241202401443 |
6 | 3103230003300435431 |
7 | 125036241123105241 |
oct | 11137274566161213 |
9 | 1511355283384631 |
10 | 323213030122123 |
11 | 93a929703a2aa9 |
12 | 30300a259a8b77 |
13 | 10b46b1cc2503b |
14 | 59b58463d8791 |
15 | 27577a52aed4d |
hex | 125f5e5d8e28b |
323213030122123 has 16 divisors (see below), whose sum is σ = 336598872064000. Its totient is φ = 310024414211040.
The previous prime is 323213030122097. The next prime is 323213030122141. The reversal of 323213030122123 is 321221030312323.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 323213030122123 - 213 = 323213030113931 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 323213030122091 and 323213030122100.
It is not an unprimeable number, because it can be changed into a prime (323213030122153) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 100500723 + ... + 103666876.
It is an arithmetic number, because the mean of its divisors is an integer number (21037429504000).
Almost surely, 2323213030122123 is an apocalyptic number.
323213030122123 is a deficient number, since it is larger than the sum of its proper divisors (13385841941877).
323213030122123 is a wasteful number, since it uses less digits than its factorization.
323213030122123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 204168082.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 323213030122123 its reverse (321221030312323), we get a palindrome (644434060434446).
The spelling of 323213030122123 in words is "three hundred twenty-three trillion, two hundred thirteen billion, thirty million, one hundred twenty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •