Base | Representation |
---|---|
bin | 101110101000100010… |
… | …0001110111011001101 |
3 | 100120111020012011010002 |
4 | 1131101010032323031 |
5 | 3120043420441023 |
6 | 114001120054045 |
7 | 10143445415144 |
oct | 1352104167315 |
9 | 316436164102 |
10 | 100144312013 |
11 | 3951a942929 |
12 | 174aa164325 |
13 | 959c699675 |
14 | 4bc02a875b |
15 | 2911c43b28 |
hex | 175110eecd |
100144312013 has 16 divisors (see below), whose sum is σ = 104328072576. Its totient is φ = 96064837440.
The previous prime is 100144312003. The next prime is 100144312019. The reversal of 100144312013 is 310213441001.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100144312013 is a prime.
It is a super-2 number, since 2×1001443120132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100144312019) 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 15 ways as a sum of consecutive naturals, for example, 447170 + ... + 632652.
It is an arithmetic number, because the mean of its divisors is an integer number (6520504536).
Almost surely, 2100144312013 is an apocalyptic number.
It is an amenable number.
100144312013 is a deficient number, since it is larger than the sum of its proper divisors (4183760563).
100144312013 is a wasteful number, since it uses less digits than its factorization.
100144312013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185764.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 100144312013 its reverse (310213441001), we get a palindrome (410357753014).
The spelling of 100144312013 in words is "one hundred billion, one hundred forty-four million, three hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •