Base | Representation |
---|---|
bin | 111100101011111101… |
… | …1100010101001101110 |
3 | 110110101112001121021200 |
4 | 1321113323202221232 |
5 | 4113401001320402 |
6 | 135511540510330 |
7 | 12262361543232 |
oct | 1712773425156 |
9 | 413345047250 |
10 | 130324245102 |
11 | 502a7703297 |
12 | 213113ab3a6 |
13 | c39c11103c |
14 | 64445905c2 |
15 | 35cb56121c |
hex | 1e57ee2a6e |
130324245102 has 24 divisors (see below), whose sum is σ = 282973860936. Its totient is φ = 43348389936.
The previous prime is 130324245097. The next prime is 130324245109. The reversal of 130324245102 is 201542423031.
130324245102 is a `hidden beast` number, since 130 + 3 + 2 + 424 + 5 + 102 = 666.
It is a super-2 number, since 2×1303242451022 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130324245109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7743453 + ... + 7760264.
It is an arithmetic number, because the mean of its divisors is an integer number (11790577539).
Almost surely, 2130324245102 is an apocalyptic number.
130324245102 is an abundant number, since it is smaller than the sum of its proper divisors (152649615834).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130324245102 is a wasteful number, since it uses less digits than its factorization.
130324245102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15504192 (or 15504189 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
Adding to 130324245102 its reverse (201542423031), we get a palindrome (331866668133).
The spelling of 130324245102 in words is "one hundred thirty billion, three hundred twenty-four million, two hundred forty-five thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •