Base | Representation |
---|---|
bin | 1010000111011000101101… |
… | …1101001011000110100101 |
3 | 1110101020212000000101012110 |
4 | 2201312023131023012211 |
5 | 2424210334030310041 |
6 | 35353214133311233 |
7 | 2225352530151261 |
oct | 241661335130645 |
9 | 43336760011173 |
10 | 11122010010021 |
11 | 35a88aa778339 |
12 | 12b762a795519 |
13 | 628a54b7ba61 |
14 | 2a64458210a1 |
15 | 144497d4d516 |
hex | a1d8b74b1a5 |
11122010010021 has 16 divisors (see below), whose sum is σ = 14866829994240. Its totient is φ = 7395955100160.
The previous prime is 11122010010017. The next prime is 11122010010061. The reversal of 11122010010021 is 12001001022111.
11122010010021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11122010010021 - 22 = 11122010010017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11122010009979 and 11122010010006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11122010010061) 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, 1026040 + ... + 4826673.
It is an arithmetic number, because the mean of its divisors is an integer number (929176874640).
Almost surely, 211122010010021 is an apocalyptic number.
It is an amenable number.
11122010010021 is a deficient number, since it is larger than the sum of its proper divisors (3744819984219).
11122010010021 is an equidigital number, since it uses as much as digits as its factorization.
11122010010021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5854316.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11122010010021 its reverse (12001001022111), we get a palindrome (23123011032132).
The spelling of 11122010010021 in words is "eleven trillion, one hundred twenty-two billion, ten million, ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •