Base | Representation |
---|---|
bin | 11001011110000111101011… |
… | …111110010010011001010011 |
3 | 112200122002210011112001000011 |
4 | 121132013223332102121103 |
5 | 104140323002230133021 |
6 | 1034125423141335351 |
7 | 32411151555664255 |
oct | 3136075376223123 |
9 | 480562704461004 |
10 | 112021001021011 |
11 | 32769926770995 |
12 | 10692506707557 |
13 | 4a676c5717284 |
14 | 1d93bb9a0bcd5 |
15 | ce3dcb28ede1 |
hex | 65e1ebf92653 |
112021001021011 has 4 divisors (see below), whose sum is σ = 112021077123072. Its totient is φ = 112020924918952.
The previous prime is 112021001020967. The next prime is 112021001021029. The reversal of 112021001021011 is 110120100120211.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 112021001021011 - 221 = 112020998923859 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112021001020982 and 112021001021000.
It is not an unprimeable number, because it can be changed into a prime (112021001121011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35798611 + ... + 38801836.
It is an arithmetic number, because the mean of its divisors is an integer number (28005269280768).
Almost surely, 2112021001021011 is an apocalyptic number.
112021001021011 is a deficient number, since it is larger than the sum of its proper divisors (76102061).
112021001021011 is an equidigital number, since it uses as much as digits as its factorization.
112021001021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76102060.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 112021001021011 its reverse (110120100120211), we get a palindrome (222141101141222).
The spelling of 112021001021011 in words is "one hundred twelve trillion, twenty-one billion, one million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •