Base | Representation |
---|---|
bin | 111100100010010111… |
… | …0110010000101010100 |
3 | 110102120001221122000010 |
4 | 1321010232302011110 |
5 | 4112221021231312 |
6 | 135415552520220 |
7 | 12251400620661 |
oct | 1710456620524 |
9 | 412501848003 |
10 | 130002133332 |
11 | 501518a6a15 |
12 | 21241550070 |
13 | c34a470866 |
14 | 64138a2a68 |
15 | 35ad13593c |
hex | 1e44bb2154 |
130002133332 has 24 divisors (see below), whose sum is σ = 303668411200. Its totient is φ = 43286887296.
The previous prime is 130002133223. The next prime is 130002133397. The reversal of 130002133332 is 233331200031.
It is a super-2 number, since 2×1300021333322 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130002133299 and 130002133308.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5883157 + ... + 5905212.
Almost surely, 2130002133332 is an apocalyptic number.
130002133332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
130002133332 is an abundant number, since it is smaller than the sum of its proper divisors (173666277868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130002133332 is a wasteful number, since it uses less digits than its factorization.
130002133332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11789295 (or 11789293 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 130002133332 its reverse (233331200031), we get a palindrome (363333333363).
The spelling of 130002133332 in words is "one hundred thirty billion, two million, one hundred thirty-three thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •