Base | Representation |
---|---|
bin | 111100101001100111… |
… | …0000000100111000000 |
3 | 110110012000022201020011 |
4 | 1321103032000213000 |
5 | 4113220232402240 |
6 | 135500034354304 |
7 | 12260411636044 |
oct | 1712316004700 |
9 | 413160281204 |
10 | 130245200320 |
11 | 50267024824 |
12 | 212aaa2b994 |
13 | c388926691 |
14 | 6437c96024 |
15 | 35c464a6ea |
hex | 1e533809c0 |
130245200320 has 84 divisors (see below), whose sum is σ = 310954713624. Its totient is φ = 51962629120.
The previous prime is 130245200303. The next prime is 130245200333. The reversal of 130245200320 is 23002542031.
It is a junction number, because it is equal to n+sod(n) for n = 130245200291 and 130245200300.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 82905135 + ... + 82906705.
Almost surely, 2130245200320 is an apocalyptic number.
130245200320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 130245200320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (155477356812).
130245200320 is an abundant number, since it is smaller than the sum of its proper divisors (180709513304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130245200320 is an frugal number, since it uses more digits than its factorization.
130245200320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2606 (or 2087 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 22.
Adding to 130245200320 its reverse (23002542031), we get a palindrome (153247742351).
The spelling of 130245200320 in words is "one hundred thirty billion, two hundred forty-five million, two hundred thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •