Base | Representation |
---|---|
bin | 11110000010010100000000… |
… | …000111001010001111010111 |
3 | 122022201122222210200220210222 |
4 | 132002110000013022033113 |
5 | 114303312414104000043 |
6 | 1144542013423504555 |
7 | 36552634565510612 |
oct | 3602240007121727 |
9 | 568648883626728 |
10 | 132100311000023 |
11 | 39100477791023 |
12 | 12995b12a5815b |
13 | 589300cba8872 |
14 | 2489991107179 |
15 | 1041373c43d68 |
hex | 7825001ca3d7 |
132100311000023 has 2 divisors, whose sum is σ = 132100311000024. Its totient is φ = 132100311000022.
The previous prime is 132100310999983. The next prime is 132100311000037. The reversal of 132100311000023 is 320000113001231.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 132100311000023 - 212 = 132100310995927 is a prime.
It is a super-2 number, since 2×1321003110000232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 132100310999965 and 132100311000010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132100311200023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66050155500011 + 66050155500012.
It is an arithmetic number, because the mean of its divisors is an integer number (66050155500012).
Almost surely, 2132100311000023 is an apocalyptic number.
132100311000023 is a deficient number, since it is larger than the sum of its proper divisors (1).
132100311000023 is an equidigital number, since it uses as much as digits as its factorization.
132100311000023 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 132100311000023 its reverse (320000113001231), we get a palindrome (452100424001254).
The spelling of 132100311000023 in words is "one hundred thirty-two trillion, one hundred billion, three hundred eleven million, twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •