Base | Representation |
---|---|
bin | 10000000000011101000… |
… | …110111111101111110101 |
3 | 10220011021220001211010021 |
4 | 100000131012333233311 |
5 | 121010300000013023 |
6 | 2201155533325141 |
7 | 142321011510334 |
oct | 20003506775765 |
9 | 3804256054107 |
10 | 1100000001013 |
11 | 394564361831 |
12 | 15922b9367b1 |
13 | 7c963aa8884 |
14 | 3b3514a7d1b |
15 | 1d9309a135d |
hex | 1001d1bfbf5 |
1100000001013 has 2 divisors, whose sum is σ = 1100000001014. Its totient is φ = 1100000001012.
The previous prime is 1100000000927. The next prime is 1100000001041. The reversal of 1100000001013 is 3101000000011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1065203575569 + 34796425444 = 1032087^2 + 186538^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100000001013 - 213 = 1099999992821 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1100000000987 and 1100000001005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1100000001073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550000000506 + 550000000507.
It is an arithmetic number, because the mean of its divisors is an integer number (550000000507).
Almost surely, 21100000001013 is an apocalyptic number.
It is an amenable number.
1100000001013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100000001013 is an equidigital number, since it uses as much as digits as its factorization.
1100000001013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3, while the sum is 7.
Adding to 1100000001013 its reverse (3101000000011), we get a palindrome (4201000001024).
The spelling of 1100000001013 in words is "one trillion, one hundred billion, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •