Base | Representation |
---|---|
bin | 100001110011011111101… |
… | …001000100011110001111 |
3 | 22020002011021002220211121 |
4 | 201303133221010132033 |
5 | 301030033303101411 |
6 | 4535104241501411 |
7 | 326555646546202 |
oct | 41633751043617 |
9 | 8202137086747 |
10 | 2323034425231 |
11 | 81621440a753 |
12 | 316277641867 |
13 | 13b0a46163a0 |
14 | 80614cc1939 |
15 | 406629eb571 |
hex | 21cdfa4478f |
2323034425231 has 16 divisors (see below), whose sum is σ = 2633468221440. Its totient is φ = 2031426367200.
The previous prime is 2323034425223. The next prime is 2323034425247. The reversal of 2323034425231 is 1325244303232.
It is a cyclic number.
It is not a de Polignac number, because 2323034425231 - 23 = 2323034425223 is a prime.
It is a super-2 number, since 2×23230344252312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2323034425211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11596386 + ... + 11795008.
It is an arithmetic number, because the mean of its divisors is an integer number (164591763840).
Almost surely, 22323034425231 is an apocalyptic number.
2323034425231 is a deficient number, since it is larger than the sum of its proper divisors (310433796209).
2323034425231 is a wasteful number, since it uses less digits than its factorization.
2323034425231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 246006.
The product of its (nonzero) digits is 103680, while the sum is 34.
Adding to 2323034425231 its reverse (1325244303232), we get a palindrome (3648278728463).
The spelling of 2323034425231 in words is "two trillion, three hundred twenty-three billion, thirty-four million, four hundred twenty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •