Base | Representation |
---|---|
bin | 11110000010100111010010… |
… | …011110110111111110100111 |
3 | 122022210122110001220102101112 |
4 | 132002213102132313332213 |
5 | 114304132322144114343 |
6 | 1144555320412015235 |
7 | 36554300022615212 |
oct | 3602472236677647 |
9 | 568718401812345 |
10 | 132121020301223 |
11 | 39109234632588 |
12 | 12999b3246151b |
13 | 5894c604cb345 |
14 | 248a9976a8779 |
15 | 1041b86dbd218 |
hex | 7829d27b7fa7 |
132121020301223 has 16 divisors (see below), whose sum is σ = 133023589687296. Its totient is φ = 131221761767520.
The previous prime is 132121020301157. The next prime is 132121020301247. The reversal of 132121020301223 is 322103020121231.
It is a cyclic number.
It is not a de Polignac number, because 132121020301223 - 220 = 132121019252647 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132121020321223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 249240968 + ... + 249770498.
It is an arithmetic number, because the mean of its divisors is an integer number (8313974355456).
Almost surely, 2132121020301223 is an apocalyptic number.
132121020301223 is a deficient number, since it is larger than the sum of its proper divisors (902569386073).
132121020301223 is a wasteful number, since it uses less digits than its factorization.
132121020301223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 532654.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 132121020301223 its reverse (322103020121231), we get a palindrome (454224040422454).
The spelling of 132121020301223 in words is "one hundred thirty-two trillion, one hundred twenty-one billion, twenty million, three hundred one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •