Base | Representation |
---|---|
bin | 101111000010000010… |
… | …0011101100111100101 |
3 | 100122200212100010101000 |
4 | 1132010010131213211 |
5 | 3123322000311323 |
6 | 114222044423513 |
7 | 10203605631114 |
oct | 1360404354745 |
9 | 318625303330 |
10 | 101000010213 |
11 | 39919966623 |
12 | 176a8847b99 |
13 | 96a7a5146b |
14 | 4c61bb1c7b |
15 | 2961e1de43 |
hex | 178411d9e5 |
101000010213 has 32 divisors (see below), whose sum is σ = 151905689600. Its totient is φ = 66309688368.
The previous prime is 101000010211. The next prime is 101000010269. The reversal of 101000010213 is 312010000101.
It is not a de Polignac number, because 101000010213 - 21 = 101000010211 is a prime.
It is a super-2 number, since 2×1010000102132 (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 = 101000010195 and 101000010204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101000010211) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9797820 + ... + 9808122.
It is an arithmetic number, because the mean of its divisors is an integer number (4747052800).
Almost surely, 2101000010213 is an apocalyptic number.
It is an amenable number.
101000010213 is a deficient number, since it is larger than the sum of its proper divisors (50905679387).
101000010213 is a wasteful number, since it uses less digits than its factorization.
101000010213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15798 (or 15792 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 101000010213 its reverse (312010000101), we get a palindrome (413010010314).
The spelling of 101000010213 in words is "one hundred one billion, ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •