Base | Representation |
---|---|
bin | 111100101011111001… |
… | …1110010100010001000 |
3 | 110110101101020100202122 |
4 | 1321113303302202020 |
5 | 4113344441304000 |
6 | 135511425150412 |
7 | 12262335350600 |
oct | 1712763624210 |
9 | 413341210678 |
10 | 130322213000 |
11 | 502a6545571 |
12 | 2131078b408 |
13 | c39b87c105 |
14 | 64441c1c00 |
15 | 35cb2ae085 |
hex | 1e57cf2888 |
130322213000 has 96 divisors (see below), whose sum is σ = 354742516440. Its totient is φ = 44681884800.
The previous prime is 130322212961. The next prime is 130322213033. The reversal of 130322213000 is 312223031.
It can be written as a sum of positive squares in 4 ways, for example, as 67247899684 + 63074313316 = 259322^2 + 251146^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 130322213000.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 1280819 + ... + 1378818.
Almost surely, 2130322213000 is an apocalyptic number.
130322213000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130322213000 is an abundant number, since it is smaller than the sum of its proper divisors (224420303440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130322213000 is a wasteful number, since it uses less digits than its factorization.
130322213000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2659672 (or 2659651 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 130322213000 its reverse (312223031), we get a palindrome (130634436031).
The spelling of 130322213000 in words is "one hundred thirty billion, three hundred twenty-two million, two hundred thirteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •