Base | Representation |
---|---|
bin | 1001001100100010011111… |
… | …0100001101010010001111 |
3 | 1022210121022102212000111211 |
4 | 2103020213310031102033 |
5 | 2311124332334341421 |
6 | 33300534450355251 |
7 | 2062332345361405 |
oct | 223104764152217 |
9 | 38717272760454 |
10 | 10111021012111 |
11 | 3249072849698 |
12 | 117370058bb27 |
13 | 58460803b5b6 |
14 | 26d539b6d475 |
15 | 1280269bc9e1 |
hex | 93227d0d48f |
10111021012111 has 8 divisors (see below), whose sum is σ = 10115679389184. Its totient is φ = 10106363698200.
The previous prime is 10111021012069. The next prime is 10111021012139. The reversal of 10111021012111 is 11121012011101.
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 10111021012111 - 215 = 10111020979343 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10111021012091 and 10111021012100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10111021012151) 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, 19082220 + ... + 19604926.
It is an arithmetic number, because the mean of its divisors is an integer number (1264459923648).
Almost surely, 210111021012111 is an apocalyptic number.
10111021012111 is a deficient number, since it is larger than the sum of its proper divisors (4658377073).
10111021012111 is an equidigital number, since it uses as much as digits as its factorization.
10111021012111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 531581.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 10111021012111 its reverse (11121012011101), we get a palindrome (21232033023212).
The spelling of 10111021012111 in words is "ten trillion, one hundred eleven billion, twenty-one million, twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •