Base | Representation |
---|---|
bin | 11001011110000111101101… |
… | …001110010100001110001011 |
3 | 112200122002211121222212210011 |
4 | 121132013231032110032023 |
5 | 104140323023113000021 |
6 | 1034125425211132351 |
7 | 32411152232211445 |
oct | 3136075516241613 |
9 | 480562747885704 |
10 | 112021022000011 |
11 | 3276993759a803 |
12 | 106925117440b7 |
13 | 4a676c9b81197 |
14 | 1d93bbc70d495 |
15 | ce3dcd035de1 |
hex | 65e1ed39438b |
112021022000011 has 8 divisors (see below), whose sum is σ = 112715882811920. Its totient is φ = 111327949762848.
The previous prime is 112021021999963. The next prime is 112021022000023. The reversal of 112021022000011 is 110000220120211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112021022000011 - 215 = 112021021967243 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112021021999955 and 112021022000000.
It is not an unprimeable number, because it can be changed into a prime (112021022000711) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 447018036 + ... + 447268561.
It is an arithmetic number, because the mean of its divisors is an integer number (14089485351490).
Almost surely, 2112021022000011 is an apocalyptic number.
112021022000011 is a deficient number, since it is larger than the sum of its proper divisors (694860811909).
112021022000011 is an equidigital number, since it uses as much as digits as its factorization.
112021022000011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 894287373.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 112021022000011 its reverse (110000220120211), we get a palindrome (222021242120222).
The spelling of 112021022000011 in words is "one hundred twelve trillion, twenty-one billion, twenty-two million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •