Base | Representation |
---|---|
bin | 100100101111110101000110… |
… | …0110000101000001011111011 |
3 | 1120101110202220020201001201101 |
4 | 1021133222030300220023323 |
5 | 314331322201120220443 |
6 | 3103243110041432231 |
7 | 125040546215016331 |
oct | 11137521460501373 |
9 | 1511422806631641 |
10 | 323233010320123 |
11 | 93aa0393727532 |
12 | 3030488119b677 |
13 | 10b489854886c7 |
14 | 59b67bdc07b51 |
15 | 275807441884d |
hex | 125fa8cc282fb |
323233010320123 has 12 divisors (see below), whose sum is σ = 343371305445480. Its totient is φ = 304213867983872.
The previous prime is 323233010320091. The next prime is 323233010320151. The reversal of 323233010320123 is 321023010332323.
It is not a de Polignac number, because 323233010320123 - 25 = 323233010320091 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 323233010320091 and 323233010320100.
It is not an unprimeable number, because it can be changed into a prime (323233010390123) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6255243 + ... + 26183851.
It is an arithmetic number, because the mean of its divisors is an integer number (28614275453790).
Almost surely, 2323233010320123 is an apocalyptic number.
323233010320123 is a deficient number, since it is larger than the sum of its proper divisors (20138295125357).
323233010320123 is a wasteful number, since it uses less digits than its factorization.
323233010320123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19984766 (or 19984749 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 28.
Adding to 323233010320123 its reverse (321023010332323), we get a palindrome (644256020652446).
The spelling of 323233010320123 in words is "three hundred twenty-three trillion, two hundred thirty-three billion, ten million, three hundred twenty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •