Base | Representation |
---|---|
bin | 101111000010011001… |
… | …1000010100100111100 |
3 | 100122201201022110100111 |
4 | 1132010303002210330 |
5 | 3123333112021340 |
6 | 114223202235404 |
7 | 10204114463602 |
oct | 1360463024474 |
9 | 318651273314 |
10 | 101012220220 |
11 | 3992584613a |
12 | 176b0955b64 |
13 | 96aa437c12 |
14 | 4c6366d872 |
15 | 2963031aea |
hex | 1784cc293c |
101012220220 has 36 divisors (see below), whose sum is σ = 212914398312. Its totient is φ = 40255207200.
The previous prime is 101012220209. The next prime is 101012220269. The reversal of 101012220220 is 22022210101.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 101012220220.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1434435 + ... + 1503205.
It is an arithmetic number, because the mean of its divisors is an integer number (5914288842).
Almost surely, 2101012220220 is an apocalyptic number.
101012220220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101012220220 is an abundant number, since it is smaller than the sum of its proper divisors (111902178092).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101012220220 is an equidigital number, since it uses as much as digits as its factorization.
101012220220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69322 (or 69049 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 101012220220 its reverse (22022210101), we get a palindrome (123034430321).
The spelling of 101012220220 in words is "one hundred one billion, twelve million, two hundred twenty thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •