Base | Representation |
---|---|
bin | 101111001011000010… |
… | …0100010111111110010 |
3 | 100200110220121220211120 |
4 | 1132112010202333302 |
5 | 3124431304202010 |
6 | 114312033523110 |
7 | 10214233660251 |
oct | 1362604427762 |
9 | 320426556746 |
10 | 101302022130 |
11 | 39a64394651 |
12 | 17771a13496 |
13 | 97254a4c3a |
14 | 4c8dd4a798 |
15 | 297d6c8e70 |
hex | 1796122ff2 |
101302022130 has 64 divisors (see below), whose sum is σ = 249779092608. Its totient is φ = 26275000320.
The previous prime is 101302022119. The next prime is 101302022141. The reversal of 101302022130 is 31220203101.
101302022130 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (101302022119) and next prime (101302022141).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3728274 + ... + 3755346.
It is an arithmetic number, because the mean of its divisors is an integer number (3902798322).
Almost surely, 2101302022130 is an apocalyptic number.
101302022130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101302022130 is an abundant number, since it is smaller than the sum of its proper divisors (148477070478).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101302022130 is a wasteful number, since it uses less digits than its factorization.
101302022130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30491.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 101302022130 its reverse (31220203101), we get a palindrome (132522225231).
The spelling of 101302022130 in words is "one hundred one billion, three hundred two million, twenty-two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •