Base | Representation |
---|---|
bin | 101110100100010011… |
… | …0001110101101100101 |
3 | 100120010022211120222201 |
4 | 1131020212032231211 |
5 | 3114301032312333 |
6 | 113535042454501 |
7 | 10140101631214 |
oct | 1351046165545 |
9 | 316108746881 |
10 | 100002229093 |
11 | 39457718928 |
12 | 1746a664431 |
13 | 9579110230 |
14 | 4ba948107b |
15 | 290452a17d |
hex | 174898eb65 |
100002229093 has 8 divisors (see below), whose sum is σ = 107697218048. Its totient is φ = 92307598704.
The previous prime is 100002229051. The next prime is 100002229111. The reversal of 100002229093 is 390922200001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100002229093 - 225 = 99968674661 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100002229013) 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 in 7 ways as a sum of consecutive naturals, for example, 870796 + ... + 978922.
It is an arithmetic number, because the mean of its divisors is an integer number (13462152256).
Almost surely, 2100002229093 is an apocalyptic number.
100002229093 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
100002229093 is a deficient number, since it is larger than the sum of its proper divisors (7694988955).
100002229093 is a wasteful number, since it uses less digits than its factorization.
100002229093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 179283.
The product of its (nonzero) digits is 1944, while the sum is 28.
Adding to 100002229093 its reverse (390922200001), we get a palindrome (490924429094).
The spelling of 100002229093 in words is "one hundred billion, two million, two hundred twenty-nine thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •