Base | Representation |
---|---|
bin | 11101100100001110101010… |
… | …111101000100001100111000 |
3 | 122001102000220120000110200002 |
4 | 131210032222331010030320 |
5 | 114020430042233133422 |
6 | 1140320200435132132 |
7 | 36250401014565062 |
oct | 3544165275041470 |
9 | 561360816013602 |
10 | 130033003021112 |
11 | 38483761285494 |
12 | 12701325744048 |
13 | 57730a0b4b949 |
14 | 24178b9398732 |
15 | 10076cbb61692 |
hex | 7643aaf44338 |
130033003021112 has 8 divisors (see below), whose sum is σ = 243811880664600. Its totient is φ = 65016501510552.
The previous prime is 130033003021007. The next prime is 130033003021147. The reversal of 130033003021112 is 211120300330031.
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-5 number, since 5×1300330030211125 (a number of 72 digits) contains 55555 as substring.
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 as a sum of consecutive naturals, namely, 8127062688812 + ... + 8127062688827.
It is an arithmetic number, because the mean of its divisors is an integer number (30476485083075).
Almost surely, 2130033003021112 is an apocalyptic number.
It is an amenable number.
130033003021112 is a deficient number, since it is larger than the sum of its proper divisors (113778877643488).
130033003021112 is a wasteful number, since it uses less digits than its factorization.
130033003021112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16254125377645 (or 16254125377641 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 130033003021112 its reverse (211120300330031), we get a palindrome (341153303351143).
The spelling of 130033003021112 in words is "one hundred thirty trillion, thirty-three billion, three million, twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •