Base | Representation |
---|---|
bin | 1110100011011000100111… |
… | …00101110100000001101111 |
3 | 11012022101002110111220221022 |
4 | 13101230103211310001233 |
5 | 13143310330240031111 |
6 | 152021324153324355 |
7 | 6512035420535600 |
oct | 721542345640157 |
9 | 135271073456838 |
10 | 32002130002031 |
11 | a2190331019a2 |
12 | 370a2887066bb |
13 | 14b1a32067347 |
14 | 7c8ca8a95da7 |
15 | 3a76aec982db |
hex | 1d1b1397406f |
32002130002031 has 12 divisors (see below), whose sum is σ = 37227060747072. Its totient is φ = 27430328475648.
The previous prime is 32002130002009. The next prime is 32002130002043. The reversal of 32002130002031 is 13020003120023.
It is not a de Polignac number, because 32002130002031 - 210 = 32002130001007 is a prime.
It is a super-2 number, since 2×320021300020312 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32002130005031) 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 in 11 ways as a sum of consecutive naturals, for example, 33549026 + ... + 34489728.
It is an arithmetic number, because the mean of its divisors is an integer number (3102255062256).
Almost surely, 232002130002031 is an apocalyptic number.
32002130002031 is a deficient number, since it is larger than the sum of its proper divisors (5224930745041).
32002130002031 is an equidigital number, since it uses as much as digits as its factorization.
32002130002031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1634990 (or 1634983 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 32002130002031 its reverse (13020003120023), we get a palindrome (45022133122054).
The spelling of 32002130002031 in words is "thirty-two trillion, two billion, one hundred thirty million, two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •