Base | Representation |
---|---|
bin | 111100110111001100… |
… | …1111110100100000000 |
3 | 110111100210121010020002 |
4 | 1321232121332210000 |
5 | 4120134014304441 |
6 | 140013210535132 |
7 | 12304620624233 |
oct | 1715631764400 |
9 | 414323533202 |
10 | 130701322496 |
11 | 504805420a8 |
12 | 213b77374a8 |
13 | c42c287b64 |
14 | 647c6a941a |
15 | 35ee6e7b9b |
hex | 1e6e67e900 |
130701322496 has 36 divisors (see below), whose sum is σ = 276238695852. Its totient is φ = 61506502656.
The previous prime is 130701322481. The next prime is 130701322501. The reversal of 130701322496 is 694223107031.
It can be written as a sum of positive squares in 2 ways, for example, as 74891984896 + 55809337600 = 273664^2 + 236240^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15011885 + ... + 15020588.
It is an arithmetic number, because the mean of its divisors is an integer number (7673297107).
Almost surely, 2130701322496 is an apocalyptic number.
130701322496 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
130701322496 is an abundant number, since it is smaller than the sum of its proper divisors (145537373356).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130701322496 is an equidigital number, since it uses as much as digits as its factorization.
130701322496 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30032506 (or 30032492 counting only the distinct ones).
The product of its (nonzero) digits is 54432, while the sum is 38.
The spelling of 130701322496 in words is "one hundred thirty billion, seven hundred one million, three hundred twenty-two thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •