Base | Representation |
---|---|
bin | 100100101110001000100110… |
… | …0111010110101011101100011 |
3 | 1120100122111111010102020201222 |
4 | 1021130101030322311131203 |
5 | 314314013010310121011 |
6 | 3102544053454045255 |
7 | 125014660244444534 |
oct | 11134211472653543 |
9 | 1510574433366658 |
10 | 323000011020131 |
11 | 93a1059869a885 |
12 | 302876961a982b |
13 | 10b2ca025a6723 |
14 | 59a93d921868b |
15 | 2751e88db3ddb |
hex | 125c44ceb5763 |
323000011020131 has 16 divisors (see below), whose sum is σ = 352502436489408. Its totient is φ = 294804904934400.
The previous prime is 323000011020091. The next prime is 323000011020151. The reversal of 323000011020131 is 131020110000323.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-323000011020131 is a prime.
It is a super-2 number, since 2×3230000110201312 (a number of 30 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (323000011020151) 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, 2193415250 + ... + 2193562503.
It is an arithmetic number, because the mean of its divisors is an integer number (22031402280588).
Almost surely, 2323000011020131 is an apocalyptic number.
323000011020131 is a deficient number, since it is larger than the sum of its proper divisors (29502425469277).
323000011020131 is a wasteful number, since it uses less digits than its factorization.
323000011020131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4386977902.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 323000011020131 its reverse (131020110000323), we get a palindrome (454020121020454).
The spelling of 323000011020131 in words is "three hundred twenty-three trillion, eleven million, twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •