Base | Representation |
---|---|
bin | 11101001000100001101… |
… | …10001100011011011111 |
3 | 10112200210002221212100101 |
4 | 32210100312030123133 |
5 | 112400032031201421 |
6 | 2043505130441531 |
7 | 132214650540631 |
oct | 16442066143337 |
9 | 3480702855311 |
10 | 1001010022111 |
11 | 356587074510 |
12 | 1420042932a7 |
13 | 73519604668 |
14 | 36640642a51 |
15 | 1b08a277191 |
hex | e910d8c6df |
1001010022111 has 4 divisors (see below), whose sum is σ = 1092010933224. Its totient is φ = 910009111000.
The previous prime is 1001010022093. The next prime is 1001010022121. The reversal of 1001010022111 is 1112200101001.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 1001010022111 - 219 = 1001009497823 is a prime.
It is a super-4 number, since 4×10010100221114 (a number of 49 digits) contains 4444 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1001010022121) 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, 45500455540 + ... + 45500455561.
It is an arithmetic number, because the mean of its divisors is an integer number (273002733306).
Almost surely, 21001010022111 is an apocalyptic number.
1001010022111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1001010022111 is a deficient number, since it is larger than the sum of its proper divisors (91000911113).
1001010022111 is an equidigital number, since it uses as much as digits as its factorization.
1001010022111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91000911112.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1001010022111 its reverse (1112200101001), we get a palindrome (2113210123112).
The spelling of 1001010022111 in words is "one trillion, one billion, ten million, twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •