Base | Representation |
---|---|
bin | 111100101011111101… |
… | …1110100111100101000 |
3 | 110110101112012102002011 |
4 | 1321113323310330220 |
5 | 4113401011220130 |
6 | 135511542245304 |
7 | 12262362304555 |
oct | 1712773647450 |
9 | 413345172064 |
10 | 130324320040 |
11 | 502a7754622 |
12 | 21311426834 |
13 | c39c139195 |
14 | 64445ada2c |
15 | 35cb57852a |
hex | 1e57ef4f28 |
130324320040 has 32 divisors (see below), whose sum is σ = 301154851080. Its totient is φ = 50720815872.
The previous prime is 130324320011. The next prime is 130324320089. The reversal of 130324320040 is 40023423031.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 129440209284 + 884110756 = 359778^2 + 29734^2 .
It is a junction number, because it is equal to n+sod(n) for n = 130324319993 and 130324320020.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 44027007 + ... + 44029966.
Almost surely, 2130324320040 is an apocalyptic number.
130324320040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130324320040 is an abundant number, since it is smaller than the sum of its proper divisors (170830531040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130324320040 is a wasteful number, since it uses less digits than its factorization.
130324320040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88057021 (or 88057017 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 22.
Adding to 130324320040 its reverse (40023423031), we get a palindrome (170347743071).
The spelling of 130324320040 in words is "one hundred thirty billion, three hundred twenty-four million, three hundred twenty thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •