Base | Representation |
---|---|
bin | 1001100110101011000100… |
… | …00110010000000000100001 |
3 | 2202210001102010001112200110 |
4 | 10303111202012100000201 |
5 | 10232012230000000113 |
6 | 112530221041041533 |
7 | 4306604200653264 |
oct | 463254206200041 |
9 | 82701363045613 |
10 | 21120000000033 |
11 | 6802a3a448080 |
12 | 24512453262a9 |
13 | ba27b876694c |
14 | 5302dba0acdb |
15 | 2695a65a2bc3 |
hex | 133562190021 |
21120000000033 has 16 divisors (see below), whose sum is σ = 30770114222016. Its totient is φ = 12779119074240.
The previous prime is 21120000000023. The next prime is 21120000000083. The reversal of 21120000000033 is 33000000002112.
It is a happy number.
It is not a de Polignac number, because 21120000000033 - 29 = 21119999999521 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21119999999946 and 21120000000018.
It is not an unprimeable number, because it can be changed into a prime (21120000000023) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 522002610 + ... + 522043067.
It is an arithmetic number, because the mean of its divisors is an integer number (1923132138876).
Almost surely, 221120000000033 is an apocalyptic number.
It is an amenable number.
21120000000033 is a deficient number, since it is larger than the sum of its proper divisors (9650114221983).
21120000000033 is a wasteful number, since it uses less digits than its factorization.
21120000000033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1044046304.
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 21120000000033 its reverse (33000000002112), we get a palindrome (54120000002145).
It can be divided in two parts, 211200000000 and 33, that multiplied together give a square (6969600000000 = 26400002).
The spelling of 21120000000033 in words is "twenty-one trillion, one hundred twenty billion, thirty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •