Base | Representation |
---|---|
bin | 101111000001001110100… |
… | …011011010101111101101 |
3 | 102102220010020101011220022 |
4 | 233001032203122233231 |
5 | 410414330112022104 |
6 | 10512210120331525 |
7 | 452304332003345 |
oct | 57011643325755 |
9 | 12386106334808 |
10 | 3231133314029 |
11 | 103635257a575 |
12 | 442270013ba5 |
13 | 1a5904c5a38a |
14 | b255db53d25 |
15 | 590b1058bbe |
hex | 2f04e8dabed |
3231133314029 has 2 divisors, whose sum is σ = 3231133314030. Its totient is φ = 3231133314028.
The previous prime is 3231133314011. The next prime is 3231133314047. The reversal of 3231133314029 is 9204133311323.
It is a balanced prime because it is at equal distance from previous prime (3231133314011) and next prime (3231133314047).
It can be written as a sum of positive squares in only one way, i.e., 1969728040900 + 1261405273129 = 1403470^2 + 1123123^2 .
It is a cyclic number.
It is not a de Polignac number, because 3231133314029 - 236 = 3162413837293 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3231133314029.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3231133313029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1615566657014 + 1615566657015.
It is an arithmetic number, because the mean of its divisors is an integer number (1615566657015).
Almost surely, 23231133314029 is an apocalyptic number.
It is an amenable number.
3231133314029 is a deficient number, since it is larger than the sum of its proper divisors (1).
3231133314029 is an equidigital number, since it uses as much as digits as its factorization.
3231133314029 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 34992, while the sum is 35.
The spelling of 3231133314029 in words is "three trillion, two hundred thirty-one billion, one hundred thirty-three million, three hundred fourteen thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •