Base | Representation |
---|---|
bin | 1001011001011010100100… |
… | …0010010011101001001001 |
3 | 1100120202022000220211102012 |
4 | 2112112221002103221021 |
5 | 2323240402432114004 |
6 | 33550321220145305 |
7 | 2114323230326234 |
oct | 226265102235111 |
9 | 40522260824365 |
10 | 10332232301129 |
11 | 3323969856212 |
12 | 11aa557838235 |
13 | 59c42c98005b |
14 | 27a122d6441b |
15 | 12db721c846e |
hex | 965a9093a49 |
10332232301129 has 2 divisors, whose sum is σ = 10332232301130. Its totient is φ = 10332232301128.
The previous prime is 10332232301123. The next prime is 10332232301141. The reversal of 10332232301129 is 92110323223301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7564507633225 + 2767724667904 = 2750365^2 + 1663648^2 .
It is a cyclic number.
It is not a de Polignac number, because 10332232301129 - 224 = 10332215523913 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10332232301095 and 10332232301104.
It is not a weakly prime, because it can be changed into another prime (10332232301123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5166116150564 + 5166116150565.
It is an arithmetic number, because the mean of its divisors is an integer number (5166116150565).
Almost surely, 210332232301129 is an apocalyptic number.
It is an amenable number.
10332232301129 is a deficient number, since it is larger than the sum of its proper divisors (1).
10332232301129 is an equidigital number, since it uses as much as digits as its factorization.
10332232301129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 32.
The spelling of 10332232301129 in words is "ten trillion, three hundred thirty-two billion, two hundred thirty-two million, three hundred one thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •