Base | Representation |
---|---|
bin | 111100110110000111… |
… | …0010110101011010110 |
3 | 110111021020201120120012 |
4 | 1321230032112223112 |
5 | 4120100132033420 |
6 | 140005422240222 |
7 | 12303664542530 |
oct | 1715416265326 |
9 | 414236646505 |
10 | 130664721110 |
11 | 50461912a20 |
12 | 213a7426072 |
13 | c424811231 |
14 | 647789c850 |
15 | 35eb3b7dc5 |
hex | 1e6c396ad6 |
130664721110 has 128 divisors (see below), whose sum is σ = 301165102080. Its totient is φ = 39638592000.
The previous prime is 130664721101. The next prime is 130664721119. The reversal of 130664721110 is 11127466031.
It is an interprime number because it is at equal distance from previous prime (130664721101) and next prime (130664721119).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130664721119) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4574192 + ... + 4602668.
It is an arithmetic number, because the mean of its divisors is an integer number (2352852360).
Almost surely, 2130664721110 is an apocalyptic number.
130664721110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130664721110 is an abundant number, since it is smaller than the sum of its proper divisors (170500380970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130664721110 is a wasteful number, since it uses less digits than its factorization.
130664721110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28662.
The product of its (nonzero) digits is 6048, while the sum is 32.
The spelling of 130664721110 in words is "one hundred thirty billion, six hundred sixty-four million, seven hundred twenty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •