Base | Representation |
---|---|
bin | 1100000110010010100110… |
… | …1000100110000010011010 |
3 | 1202002200100001010010122121 |
4 | 3001210221220212002122 |
5 | 3220420412312120010 |
6 | 44142541341211454 |
7 | 2542024135202125 |
oct | 301445150460232 |
9 | 52080301103577 |
10 | 13302212223130 |
11 | 4269489014a76 |
12 | 15aa083b60b8a |
13 | 756515c0809c |
14 | 33db8aca73bc |
15 | 18104b1793da |
hex | c1929a2609a |
13302212223130 has 32 divisors (see below), whose sum is σ = 23989913007120. Its totient is φ = 5310680348160.
The previous prime is 13302212223103. The next prime is 13302212223137. The reversal of 13302212223130 is 3132221220331.
It can be written as a sum of positive squares in 8 ways, for example, as 6396705947241 + 6905506275889 = 2529171^2 + 2627833^2 .
It is a junction number, because it is equal to n+sod(n) for n = 13302212223095 and 13302212223104.
It is not an unprimeable number, because it can be changed into a prime (13302212223137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 46584390 + ... + 46869070.
Almost surely, 213302212223130 is an apocalyptic number.
13302212223130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13302212223130 is a deficient number, since it is larger than the sum of its proper divisors (10687700783990).
13302212223130 is a wasteful number, since it uses less digits than its factorization.
13302212223130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 293634.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 13302212223130 its reverse (3132221220331), we get a palindrome (16434433443461).
The spelling of 13302212223130 in words is "thirteen trillion, three hundred two billion, two hundred twelve million, two hundred twenty-three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •