Base | Representation |
---|---|
bin | 11101001000100011000… |
… | …00000111100010001111 |
3 | 10112200210212122012210102 |
4 | 32210101200013202033 |
5 | 112400042334341421 |
6 | 2043510202201315 |
7 | 132215143132511 |
oct | 16442140074217 |
9 | 3480725565712 |
10 | 1001021012111 |
11 | 3565922a045a |
12 | 142007ab323b |
13 | 7351b981a13 |
14 | 36641ca3bb1 |
15 | 1b08b1e860b |
hex | e91180788f |
1001021012111 has 4 divisors (see below), whose sum is σ = 1001044422000. Its totient is φ = 1000997602224.
The previous prime is 1001021012093. The next prime is 1001021012141. The reversal of 1001021012111 is 1112101201001.
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 1001021012111 - 234 = 983841142927 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1001021012092 and 1001021012101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1001021012141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11640686 + ... + 11726363.
It is an arithmetic number, because the mean of its divisors is an integer number (250261105500).
Almost surely, 21001021012111 is an apocalyptic number.
1001021012111 is a deficient number, since it is larger than the sum of its proper divisors (23409889).
1001021012111 is an equidigital number, since it uses as much as digits as its factorization.
1001021012111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23409888.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1001021012111 its reverse (1112101201001), we get a palindrome (2113122213112).
The spelling of 1001021012111 in words is "one trillion, one billion, twenty-one million, twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •