Base | Representation |
---|---|
bin | 101111000010111100… |
… | …0000111111101101100 |
3 | 100122202222101112121020 |
4 | 1132011320013331230 |
5 | 3123402231031340 |
6 | 114225050334140 |
7 | 10204424431461 |
oct | 1360570077554 |
9 | 318688345536 |
10 | 101030330220 |
11 | 39934a95486 |
12 | 176b6a2a350 |
13 | 96b1108cb1 |
14 | 4c65c25668 |
15 | 296490c9d0 |
hex | 1785e07f6c |
101030330220 has 96 divisors (see below), whose sum is σ = 285042191616. Its totient is φ = 26736595200.
The previous prime is 101030330207. The next prime is 101030330221. The reversal of 101030330220 is 22033030101.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 101030330220.
It is not an unprimeable number, because it can be changed into a prime (101030330221) 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, 5322787 + ... + 5341733.
It is an arithmetic number, because the mean of its divisors is an integer number (2969189496).
Almost surely, 2101030330220 is an apocalyptic number.
101030330220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101030330220 is an abundant number, since it is smaller than the sum of its proper divisors (184011861396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101030330220 is a wasteful number, since it uses less digits than its factorization.
101030330220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19631 (or 19629 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 101030330220 its reverse (22033030101), we get a palindrome (123063360321).
The spelling of 101030330220 in words is "one hundred one billion, thirty million, three hundred thirty thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •