Base | Representation |
---|---|
bin | 111100101111001111… |
… | …1011100011010000000 |
3 | 110110200012011222122202 |
4 | 1321132133130122000 |
5 | 4114112141220000 |
6 | 135530512052332 |
7 | 12265166266265 |
oct | 1713637343200 |
9 | 413605158582 |
10 | 130434320000 |
11 | 50353856186 |
12 | 213422340a8 |
13 | c3b8b7150a |
14 | 645504526c |
15 | 35d6055dd5 |
hex | 1e5e7dc680 |
130434320000 has 80 divisors (see below), whose sum is σ = 324708286650. Its totient is φ = 52173696000.
The previous prime is 130434319937. The next prime is 130434320069. The reversal of 130434320000 is 23434031.
It can be written as a sum of positive squares in 5 ways, for example, as 101767744 + 130332552256 = 10088^2 + 361016^2 .
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×1304343200002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 735215 + ... + 895214.
Almost surely, 2130434320000 is an apocalyptic number.
130434320000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130434320000 is an abundant number, since it is smaller than the sum of its proper divisors (194273966650).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130434320000 is an frugal number, since it uses more digits than its factorization.
130434320000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1630463 (or 1630436 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 20.
Adding to 130434320000 its reverse (23434031), we get a palindrome (130457754031).
The spelling of 130434320000 in words is "one hundred thirty billion, four hundred thirty-four million, three hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •