Base | Representation |
---|---|
bin | 111100101110110101… |
… | …0101111001011010100 |
3 | 110110122020012000122100 |
4 | 1321131222233023110 |
5 | 4114100122101002 |
6 | 135525300002100 |
7 | 12264640662234 |
oct | 1713552571324 |
9 | 413566160570 |
10 | 130420503252 |
11 | 50346a79486 |
12 | 21339690330 |
13 | c3b6044620 |
14 | 6453289cc4 |
15 | 35d4c2711c |
hex | 1e5daaf2d4 |
130420503252 has 72 divisors (see below), whose sum is σ = 355117435400. Its totient is φ = 40119909120.
The previous prime is 130420503251. The next prime is 130420503271. The reversal of 130420503252 is 252305024031.
It is a happy number.
130420503252 is a `hidden beast` number, since 130 + 4 + 2 + 0 + 503 + 25 + 2 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 3104272656 + 127316230596 = 55716^2 + 356814^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130420503251) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2098302 + ... + 2159562.
Almost surely, 2130420503252 is an apocalyptic number.
130420503252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
130420503252 is an abundant number, since it is smaller than the sum of its proper divisors (224696932148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130420503252 is a wasteful number, since it uses less digits than its factorization.
130420503252 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 65833 (or 65828 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 27.
Adding to 130420503252 its reverse (252305024031), we get a palindrome (382725527283).
The spelling of 130420503252 in words is "one hundred thirty billion, four hundred twenty million, five hundred three thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •