Base | Representation |
---|---|
bin | 11110000000110110100111… |
… | …000100111101001000100111 |
3 | 122022101002011020221211000001 |
4 | 132000312213010331020213 |
5 | 114300142031422031043 |
6 | 1144423551130202131 |
7 | 36542454604550404 |
oct | 3600664704751047 |
9 | 568332136854001 |
10 | 132000033002023 |
11 | 39071999439a0a |
12 | 1297a5a7b83347 |
13 | 588671b902a84 |
14 | 2484b9b19d2ab |
15 | 103d9553e474d |
hex | 780da713d227 |
132000033002023 has 2 divisors, whose sum is σ = 132000033002024. Its totient is φ = 132000033002022.
The previous prime is 132000033001939. The next prime is 132000033002027. The reversal of 132000033002023 is 320200330000231.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132000033002023 is a prime.
It is a super-2 number, since 2×1320000330020232 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132000033002027) 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 as a sum of consecutive naturals, namely, 66000016501011 + 66000016501012.
It is an arithmetic number, because the mean of its divisors is an integer number (66000016501012).
Almost surely, 2132000033002023 is an apocalyptic number.
132000033002023 is a deficient number, since it is larger than the sum of its proper divisors (1).
132000033002023 is an equidigital number, since it uses as much as digits as its factorization.
132000033002023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 19.
Adding to 132000033002023 its reverse (320200330000231), we get a palindrome (452200363002254).
The spelling of 132000033002023 in words is "one hundred thirty-two trillion, thirty-three million, two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.048 sec. • engine limits •