Base | Representation |
---|---|
bin | 1110101001010100100010… |
… | …01111000000000010100101 |
3 | 11020000212120120201020112212 |
4 | 13110222101033000002211 |
5 | 13210131043430222203 |
6 | 152255140112453205 |
7 | 6532546134121400 |
oct | 724522117000245 |
9 | 136025516636485 |
10 | 32206101414053 |
11 | a297592700796 |
12 | 374191224a205 |
13 | 14c803a0a8858 |
14 | 7d4ad83a8d37 |
15 | 3acb4bbe71d8 |
hex | 1d4a913c00a5 |
32206101414053 has 12 divisors (see below), whose sum is σ = 38261351921472. Its totient is φ = 27017884467000.
The previous prime is 32206101414049. The next prime is 32206101414083. The reversal of 32206101414053 is 35041410160223.
It is not a de Polignac number, because 32206101414053 - 22 = 32206101414049 is a prime.
It is a super-2 number, since 2×322061014140532 (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 (32206101414083) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6992203823 + ... + 6992208428.
It is an arithmetic number, because the mean of its divisors is an integer number (3188445993456).
Almost surely, 232206101414053 is an apocalyptic number.
It is an amenable number.
32206101414053 is a deficient number, since it is larger than the sum of its proper divisors (6055250507419).
32206101414053 is a wasteful number, since it uses less digits than its factorization.
32206101414053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13984412312 (or 13984412305 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 32.
Adding to 32206101414053 its reverse (35041410160223), we get a palindrome (67247511574276).
The spelling of 32206101414053 in words is "thirty-two trillion, two hundred six billion, one hundred one million, four hundred fourteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •