Base | Representation |
---|---|
bin | 101110100100100001… |
… | …1111000001100111101 |
3 | 100120010212110110100000 |
4 | 1131021003320030331 |
5 | 3114310030014323 |
6 | 113535521224513 |
7 | 10140224661363 |
oct | 1351103701475 |
9 | 316125413300 |
10 | 100010001213 |
11 | 39461047171 |
12 | 17471192139 |
13 | 957a901a15 |
14 | 4baa505633 |
15 | 2905062e43 |
hex | 17490f833d |
100010001213 has 12 divisors (see below), whose sum is σ = 149809220288. Its totient is φ = 66673333980.
The previous prime is 100010001197. The next prime is 100010001251. The reversal of 100010001213 is 312100010001.
It is not a de Polignac number, because 100010001213 - 24 = 100010001197 is a prime.
It is a super-2 number, since 2×1000100012132 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100010001195 and 100010001204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100010001313) 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 11 ways as a sum of consecutive naturals, for example, 205781653 + ... + 205782138.
Almost surely, 2100010001213 is an apocalyptic number.
It is an amenable number.
100010001213 is a deficient number, since it is larger than the sum of its proper divisors (49799219075).
100010001213 is an frugal number, since it uses more digits than its factorization.
100010001213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 411563806 (or 411563794 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 100010001213 its reverse (312100010001), we get a palindrome (412110011214).
The spelling of 100010001213 in words is "one hundred billion, ten million, one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •