Base | Representation |
---|---|
bin | 11101100101011001101111… |
… | …001001111010001011100000 |
3 | 122001200201221210020012222112 |
4 | 131211121233021322023200 |
5 | 114023240130124233400 |
6 | 1140421210424454452 |
7 | 36256253256001163 |
oct | 3545315711721340 |
9 | 561621853205875 |
10 | 130113604133600 |
11 | 3850496252a24a |
12 | 12714a7a91a428 |
13 | 577a87767b809 |
14 | 241b763cc9ada |
15 | 1009847cbc835 |
hex | 76566f27a2e0 |
130113604133600 has 72 divisors (see below), whose sum is σ = 331450263794160. Its totient is φ = 49782596357120.
The previous prime is 130113604133567. The next prime is 130113604133609. The reversal of 130113604133600 is 6331406311031.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130113604133609) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3535677365 + ... + 3535714164.
It is an arithmetic number, because the mean of its divisors is an integer number (4603475886030).
Almost surely, 2130113604133600 is an apocalyptic number.
130113604133600 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130113604133600 is an abundant number, since it is smaller than the sum of its proper divisors (201336659660560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130113604133600 is a wasteful number, since it uses less digits than its factorization.
130113604133600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7071391572 (or 7071391559 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 32.
The spelling of 130113604133600 in words is "one hundred thirty trillion, one hundred thirteen billion, six hundred four million, one hundred thirty-three thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •