Base | Representation |
---|---|
bin | 101111000101011010… |
… | …0010100101110110100 |
3 | 100122222202100210000211 |
4 | 1132022310110232310 |
5 | 3124034441020040 |
6 | 114241211115204 |
7 | 10206452121631 |
oct | 1361264245664 |
9 | 318882323024 |
10 | 101113220020 |
11 | 3997785a84a |
12 | 1771a742b04 |
13 | 96c533b807 |
14 | 4c72c41188 |
15 | 296bd328ea |
hex | 178ad14bb4 |
101113220020 has 24 divisors (see below), whose sum is σ = 212345116200. Its totient is φ = 40443887232.
The previous prime is 101113220017. The next prime is 101113220063. The reversal of 101113220020 is 20022311101.
It can be written as a sum of positive squares in 4 ways, for example, as 8050396176 + 93062823844 = 89724^2 + 305062^2 .
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 660066 + ... + 798694.
It is an arithmetic number, because the mean of its divisors is an integer number (8847713175).
Almost surely, 2101113220020 is an apocalyptic number.
101113220020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101113220020 is an abundant number, since it is smaller than the sum of its proper divisors (111231896180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101113220020 is a wasteful number, since it uses less digits than its factorization.
101113220020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175107 (or 175105 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 101113220020 its reverse (20022311101), we get a palindrome (121135531121).
The spelling of 101113220020 in words is "one hundred one billion, one hundred thirteen million, two hundred twenty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •