Base | Representation |
---|---|
bin | 10000001010101110000… |
… | …000110100000001001111 |
3 | 10221012201222001010200012 |
4 | 100022232000310001033 |
5 | 121200332334323043 |
6 | 2210221312023435 |
7 | 143161064530010 |
oct | 20125600640117 |
9 | 3835658033605 |
10 | 1111021011023 |
11 | 3991aa43a770 |
12 | 15b3a6831b7b |
13 | 809cc17b281 |
14 | 3bab9087007 |
15 | 1dd782e0a18 |
hex | 102ae03404f |
1111021011023 has 32 divisors (see below), whose sum is σ = 1468437424128. Its totient is φ = 813812083200.
The previous prime is 1111021010977. The next prime is 1111021011031. The reversal of 1111021011023 is 3201101201111.
It is a cyclic number.
It is not a de Polignac number, because 1111021011023 - 238 = 836143104079 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1111021010989 and 1111021011007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1111021011923) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 557786 + ... + 1591592.
It is an arithmetic number, because the mean of its divisors is an integer number (45888669504).
Almost surely, 21111021011023 is an apocalyptic number.
1111021011023 is a deficient number, since it is larger than the sum of its proper divisors (357416413105).
1111021011023 is a wasteful number, since it uses less digits than its factorization.
1111021011023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1034663.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 1111021011023 its reverse (3201101201111), we get a palindrome (4312122212134).
The spelling of 1111021011023 in words is "one trillion, one hundred eleven billion, twenty-one million, eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •