Base | Representation |
---|---|
bin | 111100101001110100… |
… | …0100001111101000101 |
3 | 110110012111101221000200 |
4 | 1321103220201331011 |
5 | 4113224022341040 |
6 | 135500443401113 |
7 | 12260525013156 |
oct | 1712350417505 |
9 | 413174357020 |
10 | 130252152645 |
11 | 5026aa4314a |
12 | 212b1223199 |
13 | c38a1bbc94 |
14 | 6438b8592d |
15 | 35c5070630 |
hex | 1e53a21f45 |
130252152645 has 48 divisors (see below), whose sum is σ = 238030665600. Its totient is φ = 65707044480.
The previous prime is 130252152619. The next prime is 130252152649. The reversal of 130252152645 is 546251252031.
130252152645 is a `hidden beast` number, since 1 + 3 + 0 + 2 + 5 + 2 + 1 + 5 + 2 + 645 = 666.
It is not a de Polignac number, because 130252152645 - 27 = 130252152517 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130252152649) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 418791 + ... + 660219.
It is an arithmetic number, because the mean of its divisors is an integer number (4958972200).
Almost surely, 2130252152645 is an apocalyptic number.
130252152645 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
130252152645 is a deficient number, since it is larger than the sum of its proper divisors (107778512955).
130252152645 is a wasteful number, since it uses less digits than its factorization.
130252152645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 242090 (or 242087 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 36.
The spelling of 130252152645 in words is "one hundred thirty billion, two hundred fifty-two million, one hundred fifty-two thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •