Base | Representation |
---|---|
bin | 101111000101000011… |
… | …0111001000001001110 |
3 | 100122221220221200121002 |
4 | 1132022012321001032 |
5 | 3124023413410110 |
6 | 114240103540302 |
7 | 10206245645630 |
oct | 1361206710116 |
9 | 318856850532 |
10 | 101101310030 |
11 | 39971065686 |
12 | 1771675a692 |
13 | 96c2a2b796 |
14 | 4c71420a50 |
15 | 296ac7daa5 |
hex | 178a1b904e |
101101310030 has 64 divisors (see below), whose sum is σ = 215261729280. Its totient is φ = 33450883200.
The previous prime is 101101310029. The next prime is 101101310033. The reversal of 101101310030 is 30013101101.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 101101309993 and 101101310020.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101101310033) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 4314245 + ... + 4337615.
It is an arithmetic number, because the mean of its divisors is an integer number (3363464520).
Almost surely, 2101101310030 is an apocalyptic number.
101101310030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101101310030 is an abundant number, since it is smaller than the sum of its proper divisors (114160419250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101101310030 is a wasteful number, since it uses less digits than its factorization.
101101310030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25545.
The product of its (nonzero) digits is 9, while the sum is 11.
Adding to 101101310030 its reverse (30013101101), we get a palindrome (131114411131).
The spelling of 101101310030 in words is "one hundred one billion, one hundred one million, three hundred ten thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •