Base | Representation |
---|---|
bin | 1110101001001011000100… |
… | …11011101000110010010111 |
3 | 11020000101110112110011110111 |
4 | 13110211202123220302113 |
5 | 13210040142413331411 |
6 | 152252540034503451 |
7 | 6532306216224010 |
oct | 724454233506227 |
9 | 136011415404414 |
10 | 32201021230231 |
11 | a295416007467 |
12 | 3740934a34b87 |
13 | 14c770a754019 |
14 | 7d47757d4007 |
15 | 3ac950c02721 |
hex | 1d49626e8c97 |
32201021230231 has 16 divisors (see below), whose sum is σ = 36835535314944. Its totient is φ = 27575102719584.
The previous prime is 32201021230097. The next prime is 32201021230241. The reversal of 32201021230231 is 13203212010223.
It is not a de Polignac number, because 32201021230231 - 213 = 32201021222039 is a prime.
It is a super-2 number, since 2×322010212302312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32201021230241) 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 15 ways as a sum of consecutive naturals, for example, 115519981 + ... + 115798393.
It is an arithmetic number, because the mean of its divisors is an integer number (2302220957184).
Almost surely, 232201021230231 is an apocalyptic number.
32201021230231 is a deficient number, since it is larger than the sum of its proper divisors (4634514084713).
32201021230231 is a wasteful number, since it uses less digits than its factorization.
32201021230231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 293790.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 32201021230231 its reverse (13203212010223), we get a palindrome (45404233240454).
The spelling of 32201021230231 in words is "thirty-two trillion, two hundred one billion, twenty-one million, two hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •