Base | Representation |
---|---|
bin | 101110101110000100… |
… | …0100111011000000001 |
3 | 100120222011121121000111 |
4 | 1131130020213120001 |
5 | 3120433440310423 |
6 | 114031352151321 |
7 | 10151162005054 |
oct | 1353410473001 |
9 | 316864547014 |
10 | 100330010113 |
11 | 39605747633 |
12 | 17540398541 |
13 | 95cbcb6cb8 |
14 | 4bdac06a9b |
15 | 29231c560d |
hex | 175c227601 |
100330010113 has 2 divisors, whose sum is σ = 100330010114. Its totient is φ = 100330010112.
The previous prime is 100330010087. The next prime is 100330010141. The reversal of 100330010113 is 311010033001.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 94109059984 + 6220950129 = 306772^2 + 78873^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100330010113 is a prime.
It is a super-2 number, since 2×1003300101132 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100330010093 and 100330010102.
It is not a weakly prime, because it can be changed into another prime (100330010153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50165005056 + 50165005057.
It is an arithmetic number, because the mean of its divisors is an integer number (50165005057).
Almost surely, 2100330010113 is an apocalyptic number.
It is an amenable number.
100330010113 is a deficient number, since it is larger than the sum of its proper divisors (1).
100330010113 is an equidigital number, since it uses as much as digits as its factorization.
100330010113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27, while the sum is 13.
Adding to 100330010113 its reverse (311010033001), we get a palindrome (411340043114).
The spelling of 100330010113 in words is "one hundred billion, three hundred thirty million, ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •