Base | Representation |
---|---|
bin | 101110101010001110… |
… | …0011111000010011001 |
3 | 100120122011212020221101 |
4 | 1131110130133002121 |
5 | 3120202424013423 |
6 | 114010503111401 |
7 | 10145034312403 |
oct | 1352434370231 |
9 | 316564766841 |
10 | 100201001113 |
11 | 39549942224 |
12 | 17505142561 |
13 | 95ab357605 |
14 | 4bc7a23b73 |
15 | 2916be07ad |
hex | 175471f099 |
100201001113 has 2 divisors, whose sum is σ = 100201001114. Its totient is φ = 100201001112.
The previous prime is 100201001111. The next prime is 100201001161. The reversal of 100201001113 is 311100102001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 65921589504 + 34279411609 = 256752^2 + 185147^2 .
It is a cyclic number.
It is not a de Polignac number, because 100201001113 - 21 = 100201001111 is a prime.
Together with 100201001111, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 100201001113.
It is not a weakly prime, because it can be changed into another prime (100201001111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50100500556 + 50100500557.
It is an arithmetic number, because the mean of its divisors is an integer number (50100500557).
Almost surely, 2100201001113 is an apocalyptic number.
It is an amenable number.
100201001113 is a deficient number, since it is larger than the sum of its proper divisors (1).
100201001113 is an equidigital number, since it uses as much as digits as its factorization.
100201001113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 100201001113 its reverse (311100102001), we get a palindrome (411301103114).
The spelling of 100201001113 in words is "one hundred billion, two hundred one million, one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •