Base | Representation |
---|---|
bin | 101111001011000010… |
… | …1001110011011011110 |
3 | 100200110220221221212110 |
4 | 1132112011032123132 |
5 | 3124431330400110 |
6 | 114312041414450 |
7 | 10214235331023 |
oct | 1362605163336 |
9 | 320426857773 |
10 | 101302200030 |
11 | 39a644a6279 |
12 | 17771a9a426 |
13 | 9725537bc5 |
14 | 4c8dd9554a |
15 | 297d711a20 |
hex | 179614e6de |
101302200030 has 64 divisors (see below), whose sum is σ = 243695304000. Its totient is φ = 26950671360.
The previous prime is 101302200023. The next prime is 101302200037. The reversal of 101302200030 is 30002203101.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (101302200023) and next prime (101302200037).
It is a junction number, because it is equal to n+sod(n) for n = 101302199979 and 101302200015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101302200037) 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, 29369746 + ... + 29373194.
It is an arithmetic number, because the mean of its divisors is an integer number (3807739125).
Almost surely, 2101302200030 is an apocalyptic number.
101302200030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101302200030 is an abundant number, since it is smaller than the sum of its proper divisors (142393103970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101302200030 is a wasteful number, since it uses less digits than its factorization.
101302200030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5469.
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 101302200030 its reverse (30002203101), we get a palindrome (131304403131).
The spelling of 101302200030 in words is "one hundred one billion, three hundred two million, two hundred thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •