Base | Representation |
---|---|
bin | 101110101101100100… |
… | …0111010010000000101 |
3 | 100120221000012011001200 |
4 | 1131123020322100011 |
5 | 3120420201411323 |
6 | 114025554213113 |
7 | 10150600032234 |
oct | 1353310722005 |
9 | 316830164050 |
10 | 100313310213 |
11 | 395a7280766 |
12 | 17536884199 |
13 | 95c86ba9bc |
14 | 4bd88dab1b |
15 | 29219c7443 |
hex | 175b23a405 |
100313310213 has 6 divisors (see below), whose sum is σ = 144897003654. Its totient is φ = 66875540136.
The previous prime is 100313310193. The next prime is 100313310221. The reversal of 100313310213 is 312013313001.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 98934153444 + 1379156769 = 314538^2 + 37137^2 .
It is not a de Polignac number, because 100313310213 - 221 = 100311213061 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100313317213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5572961670 + ... + 5572961687.
It is an arithmetic number, because the mean of its divisors is an integer number (24149500609).
Almost surely, 2100313310213 is an apocalyptic number.
It is an amenable number.
100313310213 is a deficient number, since it is larger than the sum of its proper divisors (44583693441).
100313310213 is a wasteful number, since it uses less digits than its factorization.
100313310213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11145923363 (or 11145923360 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 100313310213 its reverse (312013313001), we get a palindrome (412326623214).
The spelling of 100313310213 in words is "one hundred billion, three hundred thirteen million, three hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •