Base | Representation |
---|---|
bin | 11101001000100000100… |
… | …00011000100001111111 |
3 | 10112200202102022021202211 |
4 | 32210100100120201333 |
5 | 112400022012011312 |
6 | 2043504134201251 |
7 | 132214500356146 |
oct | 16442020304177 |
9 | 3480672267684 |
10 | 1001000110207 |
11 | 356581514559 |
12 | 142000ab3227 |
13 | 73517543c26 |
14 | 3663d1c275d |
15 | 1b08946a3a7 |
hex | e91041887f |
1001000110207 has 4 divisors (see below), whose sum is σ = 1001030378616. Its totient is φ = 1000969841800.
The previous prime is 1001000110189. The next prime is 1001000110223. The reversal of 1001000110207 is 7020110001001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1001000110207 is a prime.
It is a super-2 number, since 2×10010001102072 (a number of 25 digits) contains 22 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 (1001000110507) 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, 15084544 + ... + 15150757.
It is an arithmetic number, because the mean of its divisors is an integer number (250257594654).
Almost surely, 21001000110207 is an apocalyptic number.
1001000110207 is a deficient number, since it is larger than the sum of its proper divisors (30268409).
1001000110207 is an equidigital number, since it uses as much as digits as its factorization.
1001000110207 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30268408.
The product of its (nonzero) digits is 14, while the sum is 13.
Adding to 1001000110207 its reverse (7020110001001), we get a palindrome (8021110111208).
The spelling of 1001000110207 in words is "one trillion, one billion, one hundred ten thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •