Base | Representation |
---|---|
bin | 1001001001111011001010… |
… | …01110111100100011110000 |
3 | 2122021121202100011011002221 |
4 | 10210331211032330203300 |
5 | 10114321231243230412 |
6 | 110452335404050424 |
7 | 4145334635431231 |
oct | 444754516744360 |
9 | 78247670134087 |
10 | 20132210133232 |
11 | 6462027857a5a |
12 | 2311910533a14 |
13 | b305c80272c2 |
14 | 4d8593081088 |
15 | 24da41c68b07 |
hex | 124f653bc8f0 |
20132210133232 has 40 divisors (see below), whose sum is σ = 41301340473600. Its totient is φ = 9473819860992.
The previous prime is 20132210133221. The next prime is 20132210133251. The reversal of 20132210133232 is 23233101223102.
It is a junction number, because it is equal to n+sod(n) for n = 20132210133197 and 20132210133206.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 16190769 + ... + 17389807.
It is an arithmetic number, because the mean of its divisors is an integer number (1032533511840).
Almost surely, 220132210133232 is an apocalyptic number.
It is an amenable number.
20132210133232 is an abundant number, since it is smaller than the sum of its proper divisors (21169130340368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20132210133232 is a wasteful number, since it uses less digits than its factorization.
20132210133232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1260793 (or 1260787 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 20132210133232 its reverse (23233101223102), we get a palindrome (43365311356334).
The spelling of 20132210133232 in words is "twenty trillion, one hundred thirty-two billion, two hundred ten million, one hundred thirty-three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •