Base | Representation |
---|---|
bin | 101110100100100111… |
… | …1011001110000000101 |
3 | 100120011002010221100220 |
4 | 1131021033121300011 |
5 | 3114311313202323 |
6 | 113540110054553 |
7 | 10140262443066 |
oct | 1351117316005 |
9 | 316132127326 |
10 | 100013022213 |
11 | 3946281a965 |
12 | 174721aa459 |
13 | 957b41bab0 |
14 | 4baaa9056d |
15 | 290545d0e3 |
hex | 17493d9c05 |
100013022213 has 64 divisors (see below), whose sum is σ = 149874278400. Its totient is φ = 58908499200.
The previous prime is 100013022181. The next prime is 100013022259. The reversal of 100013022213 is 312220310001.
It is not a de Polignac number, because 100013022213 - 25 = 100013022181 is a prime.
It is a super-2 number, since 2×1000130222132 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100013022192 and 100013022201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100013022913) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 47376028 + ... + 47378138.
It is an arithmetic number, because the mean of its divisors is an integer number (2341785600).
Almost surely, 2100013022213 is an apocalyptic number.
100013022213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
100013022213 is a deficient number, since it is larger than the sum of its proper divisors (49861256187).
100013022213 is a wasteful number, since it uses less digits than its factorization.
100013022213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2570.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 100013022213 its reverse (312220310001), we get a palindrome (412233332214).
The spelling of 100013022213 in words is "one hundred billion, thirteen million, twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •