Base | Representation |
---|---|
bin | 10110110011110000001000… |
… | …100100101110100111011010 |
3 | 111011011212102022201122201220 |
4 | 112303300020210232213122 |
5 | 101122013320400324401 |
6 | 553203201220352510 |
7 | 30062255365242003 |
oct | 2663601044564732 |
9 | 434155368648656 |
10 | 100313400011226 |
11 | 29a65746161216 |
12 | b3014aa845736 |
13 | 43c868918cc7c |
14 | 1aab2a18881aa |
15 | b8e5ad597336 |
hex | 5b3c0892e9da |
100313400011226 has 16 divisors (see below), whose sum is σ = 200626910855904. Its totient is φ = 33437781531504.
The previous prime is 100313400011221. The next prime is 100313400011243. The reversal of 100313400011226 is 622110004313001.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 100313400011196 and 100313400011205.
It is not an unprimeable number, because it can be changed into a prime (100313400011221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11446905 + ... + 18211491.
It is an arithmetic number, because the mean of its divisors is an integer number (12539181928494).
Almost surely, 2100313400011226 is an apocalyptic number.
100313400011226 is an abundant number, since it is smaller than the sum of its proper divisors (100313510844678).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100313400011226 is a wasteful number, since it uses less digits than its factorization.
100313400011226 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9236125.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 100313400011226 its reverse (622110004313001), we get a palindrome (722423404324227).
The spelling of 100313400011226 in words is "one hundred trillion, three hundred thirteen billion, four hundred million, eleven thousand, two hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •