Base | Representation |
---|---|
bin | 10011110110001111… |
… | …011100011101001000 |
3 | 2001000012121201012200 |
4 | 103312033130131020 |
5 | 322121121104112 |
6 | 13442403040200 |
7 | 1353052320606 |
oct | 236617343510 |
9 | 61005551180 |
10 | 21311113032 |
11 | 9046627710 |
12 | 4169070060 |
13 | 2018203c71 |
14 | 106249a876 |
15 | 84ae03cdc |
hex | 4f63dc748 |
21311113032 has 96 divisors (see below), whose sum is σ = 66278628000. Its totient is φ = 6118018560.
The previous prime is 21311113003. The next prime is 21311113063. The reversal of 21311113032 is 23031111312.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 21311112996 and 21311113014.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 693057 + ... + 723152.
It is an arithmetic number, because the mean of its divisors is an integer number (690402375).
Almost surely, 221311113032 is an apocalyptic number.
21311113032 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
21311113032 is an abundant number, since it is smaller than the sum of its proper divisors (44967514968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21311113032 is a wasteful number, since it uses less digits than its factorization.
21311113032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1416251 (or 1416244 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 21311113032 its reverse (23031111312), we get a palindrome (44342224344).
The spelling of 21311113032 in words is "twenty-one billion, three hundred eleven million, one hundred thirteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •