Base | Representation |
---|---|
bin | 111100101111011100… |
… | …0111110001100100000 |
3 | 110110200122202222100121 |
4 | 1321132320332030200 |
5 | 4114120344341000 |
6 | 135531311330024 |
7 | 12265310210425 |
oct | 1713670761440 |
9 | 413618688317 |
10 | 130441012000 |
11 | 50357606a62 |
12 | 21344520914 |
13 | c3ba375490 |
14 | 6455ca7d4c |
15 | 35d6928b1a |
hex | 1e5ee3e320 |
130441012000 has 96 divisors (see below), whose sum is σ = 345147055344. Its totient is φ = 48162816000.
The previous prime is 130441011983. The next prime is 130441012003. The reversal of 130441012000 is 210144031.
It can be written as a sum of positive squares in 8 ways, for example, as 12844142224 + 117596869776 = 113332^2 + 342924^2 .
It is a super-2 number, since 2×1304410120002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is not an unprimeable number, because it can be changed into a prime (130441012003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1202241 + ... + 1306240.
Almost surely, 2130441012000 is an apocalyptic number.
130441012000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130441012000 is an abundant number, since it is smaller than the sum of its proper divisors (214706043344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130441012000 is a wasteful number, since it uses less digits than its factorization.
130441012000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2508519 (or 2508501 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 130441012000 its reverse (210144031), we get a palindrome (130651156031).
The spelling of 130441012000 in words is "one hundred thirty billion, four hundred forty-one million, twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •