Base | Representation |
---|---|
bin | 101111000101111010… |
… | …1011111011000110110 |
3 | 100200000221111200111220 |
4 | 1132023311133120312 |
5 | 3124103324144110 |
6 | 114243021211210 |
7 | 10210050251421 |
oct | 1361365373066 |
9 | 320027450456 |
10 | 101130303030 |
11 | 39986468539 |
12 | 17724400b06 |
13 | 96c8a402c3 |
14 | 4c7520a9b8 |
15 | 296d5a9370 |
hex | 178bd5f636 |
101130303030 has 16 divisors (see below), whose sum is σ = 242712727344. Its totient is φ = 26968080800.
The previous prime is 101130303023. The next prime is 101130303067. The reversal of 101130303030 is 30303031101.
It is a Harshad number since it is a multiple of its sum of digits (15).
101130303030 is a modest number, since divided by 303030 gives 101130 as remainder.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1685505021 + ... + 1685505080.
It is an arithmetic number, because the mean of its divisors is an integer number (15169545459).
Almost surely, 2101130303030 is an apocalyptic number.
101130303030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101130303030 is an abundant number, since it is smaller than the sum of its proper divisors (141582424314).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101130303030 is a wasteful number, since it uses less digits than its factorization.
101130303030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3371010111.
The product of its (nonzero) digits is 81, while the sum is 15.
Adding to 101130303030 its reverse (30303031101), we get a palindrome (131433334131).
The spelling of 101130303030 in words is "one hundred one billion, one hundred thirty million, three hundred three thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •