Base | Representation |
---|---|
bin | 10110101111001100010000… |
… | …100010110000110100100101 |
3 | 111010001220111000101110200221 |
4 | 112233030100202300310211 |
5 | 101101400000240213333 |
6 | 552403211042204341 |
7 | 30030522151406362 |
oct | 2657142042606445 |
9 | 433056430343627 |
10 | 100000001101093 |
11 | 29954842699475 |
12 | b2708060536b1 |
13 | 43a4c62440192 |
14 | 1a9a05101b469 |
15 | b8636993ad2d |
hex | 5af3108b0d25 |
100000001101093 has 2 divisors, whose sum is σ = 100000001101094. Its totient is φ = 100000001101092.
The previous prime is 100000001101087. The next prime is 100000001101127. The reversal of 100000001101093 is 390101100000001.
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., 78101176475169 + 21898824625924 = 8837487^2 + 4679618^2 .
It is a cyclic number.
It is not a de Polignac number, because 100000001101093 - 29 = 100000001100581 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100000001101193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50000000550546 + 50000000550547.
It is an arithmetic number, because the mean of its divisors is an integer number (50000000550547).
Almost surely, 2100000001101093 is an apocalyptic number.
It is an amenable number.
100000001101093 is a deficient number, since it is larger than the sum of its proper divisors (1).
100000001101093 is an equidigital number, since it uses as much as digits as its factorization.
100000001101093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 16.
Adding to 100000001101093 its reverse (390101100000001), we get a palindrome (490101101101094).
The spelling of 100000001101093 in words is "one hundred trillion, one million, one hundred one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •