Base | Representation |
---|---|
bin | 101111000010101010… |
… | …1011010010010001100 |
3 | 100122202100021012202012 |
4 | 1132011111122102030 |
5 | 3123342413331340 |
6 | 114224123320352 |
7 | 10204254201041 |
oct | 1360525322214 |
9 | 318670235665 |
10 | 101021230220 |
11 | 3992a93a519 |
12 | 176b39800b8 |
13 | 96ac270c91 |
14 | 4c649371c8 |
15 | 2963c11565 |
hex | 178555a48c |
101021230220 has 12 divisors (see below), whose sum is σ = 212144583504. Its totient is φ = 40408492080.
The previous prime is 101021230187. The next prime is 101021230241. The reversal of 101021230220 is 22032120101.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 101021230195 and 101021230204.
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 3 ways as a sum of consecutive naturals, for example, 2525530736 + ... + 2525530775.
It is an arithmetic number, because the mean of its divisors is an integer number (17678715292).
Almost surely, 2101021230220 is an apocalyptic number.
101021230220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101021230220 is an abundant number, since it is smaller than the sum of its proper divisors (111123353284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101021230220 is a wasteful number, since it uses less digits than its factorization.
101021230220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5051061520 (or 5051061518 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 101021230220 its reverse (22032120101), we get a palindrome (123053350321).
The spelling of 101021230220 in words is "one hundred one billion, twenty-one million, two hundred thirty thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •