Base | Representation |
---|---|
bin | 101111001000100110… |
… | …0011010111100010101 |
3 | 100200021012122221021012 |
4 | 1132101030122330111 |
5 | 3124244332401323 |
6 | 114255552102005 |
7 | 10212221335346 |
oct | 1362114327425 |
9 | 320235587235 |
10 | 101220200213 |
11 | 39a22189630 |
12 | 1774a534905 |
13 | 97115574c2 |
14 | 4c8312c0cd |
15 | 2976415678 |
hex | 179131af15 |
101220200213 has 4 divisors (see below), whose sum is σ = 110422036608. Its totient is φ = 92018363820.
The previous prime is 101220200111. The next prime is 101220200227. The reversal of 101220200213 is 312002022101.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 101220200213 - 226 = 101153091349 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101220200513) 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 3 ways as a sum of consecutive naturals, for example, 4600918181 + ... + 4600918202.
It is an arithmetic number, because the mean of its divisors is an integer number (27605509152).
Almost surely, 2101220200213 is an apocalyptic number.
It is an amenable number.
101220200213 is a deficient number, since it is larger than the sum of its proper divisors (9201836395).
101220200213 is an equidigital number, since it uses as much as digits as its factorization.
101220200213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9201836394.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 101220200213 its reverse (312002022101), we get a palindrome (413222222314).
The spelling of 101220200213 in words is "one hundred one billion, two hundred twenty million, two hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •