Base | Representation |
---|---|
bin | 11101001000101100101… |
… | …01100011111100111011 |
3 | 10112201000112021110222211 |
4 | 32210112111203330323 |
5 | 112400224121143003 |
6 | 2043522220555551 |
7 | 132220146465652 |
oct | 16442625437473 |
9 | 3481015243884 |
10 | 1001102131003 |
11 | 356624066267 |
12 | 14202b0b2bb7 |
13 | 73532714470 |
14 | 3664c97c199 |
15 | 1b0933bd96d |
hex | e916563f3b |
1001102131003 has 16 divisors (see below), whose sum is σ = 1084676060160. Its totient is φ = 918482236704.
The previous prime is 1001102130989. The next prime is 1001102131037. The reversal of 1001102131003 is 3001312011001.
It is a cyclic number.
It is not a de Polignac number, because 1001102131003 - 221 = 1001100033851 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1001102131303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1167450 + ... + 1834432.
It is an arithmetic number, because the mean of its divisors is an integer number (67792253760).
Almost surely, 21001102131003 is an apocalyptic number.
1001102131003 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1001102131003 is a deficient number, since it is larger than the sum of its proper divisors (83573929157).
1001102131003 is a wasteful number, since it uses less digits than its factorization.
1001102131003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 667698.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 1001102131003 its reverse (3001312011001), we get a palindrome (4002414142004).
The spelling of 1001102131003 in words is "one trillion, one billion, one hundred two million, one hundred thirty-one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •