Base | Representation |
---|---|
bin | 11101110100000100… |
… | …111000111111000000 |
3 | 10001121222121202201120 |
4 | 131310010320333000 |
5 | 1011030111210422 |
6 | 22412312432240 |
7 | 2212202203431 |
oct | 356404707700 |
9 | 101558552646 |
10 | 32012210112 |
11 | 126380702a3 |
12 | 62549a8680 |
13 | 3032225c7c |
14 | 17997a1488 |
15 | c755ee45c |
hex | 774138fc0 |
32012210112 has 56 divisors (see below), whose sum is σ = 84812136192. Its totient is φ = 10656480000.
The previous prime is 32012210107. The next prime is 32012210119. The reversal of 32012210112 is 21101221023.
It is a junction number, because it is equal to n+sod(n) for n = 32012210091 and 32012210100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32012210119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33187 + ... + 255197.
It is an arithmetic number, because the mean of its divisors is an integer number (1514502432).
Almost surely, 232012210112 is an apocalyptic number.
32012210112 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
32012210112 is an abundant number, since it is smaller than the sum of its proper divisors (52799926080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32012210112 is a wasteful number, since it uses less digits than its factorization.
32012210112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222777 (or 222767 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 32012210112 its reverse (21101221023), we get a palindrome (53113431135).
The spelling of 32012210112 in words is "thirty-two billion, twelve million, two hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •