Base | Representation |
---|---|
bin | 10000000000011101001… |
… | …010111010111111010111 |
3 | 10220011021222000002202201 |
4 | 100000131022322333113 |
5 | 121010300230430403 |
6 | 2201200011345331 |
7 | 142321023324523 |
oct | 20003512727727 |
9 | 3804258002681 |
10 | 1100001030103 |
11 | 3945649a4a18 |
12 | 159230152247 |
13 | 7c9640790c1 |
14 | 3b351694d83 |
15 | 1d930b0621d |
hex | 1001d2bafd7 |
1100001030103 has 2 divisors, whose sum is σ = 1100001030104. Its totient is φ = 1100001030102.
The previous prime is 1100001030091. The next prime is 1100001030109. The reversal of 1100001030103 is 3010301000011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1100001030103 - 29 = 1100001029591 is a prime.
It is a super-2 number, since 2×11000010301032 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1100001030103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1100001030109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550000515051 + 550000515052.
It is an arithmetic number, because the mean of its divisors is an integer number (550000515052).
Almost surely, 21100001030103 is an apocalyptic number.
1100001030103 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100001030103 is an equidigital number, since it uses as much as digits as its factorization.
1100001030103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9, while the sum is 10.
Adding to 1100001030103 its reverse (3010301000011), we get a palindrome (4110302030114).
The spelling of 1100001030103 in words is "one trillion, one hundred billion, one million, thirty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •