Base | Representation |
---|---|
bin | 11101110001000010010101… |
… | …110001001110011110010000 |
3 | 122011112011122010122200212010 |
4 | 131301002111301032132100 |
5 | 114124340030132012400 |
6 | 1142232353304302520 |
7 | 36401106023550150 |
oct | 3561022561163620 |
9 | 564464563580763 |
10 | 130913115891600 |
11 | 38792a39028559 |
12 | 12823a09771a40 |
13 | 580809142bba3 |
14 | 244832b47a760 |
15 | 102053d2ba450 |
hex | 771095c4e790 |
130913115891600 has 120 divisors (see below), whose sum is σ = 479266683352000. Its totient is φ = 29922997916160.
The previous prime is 130913115891539. The next prime is 130913115891703. The reversal of 130913115891600 is 6198511319031.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a self number, because there is not a number n which added to its sum of digits gives 130913115891600.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7792438975 + ... + 7792455774.
Almost surely, 2130913115891600 is an apocalyptic number.
130913115891600 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130913115891600 is an abundant number, since it is smaller than the sum of its proper divisors (348353567460400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130913115891600 is a wasteful number, since it uses less digits than its factorization.
130913115891600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15584894777 (or 15584894766 counting only the distinct ones).
The product of its (nonzero) digits is 174960, while the sum is 48.
The spelling of 130913115891600 in words is "one hundred thirty trillion, nine hundred thirteen billion, one hundred fifteen million, eight hundred ninety-one thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •