Base | Representation |
---|---|
bin | 1011000110101101110101… |
… | …1111111110101010111010 |
3 | 1121020021011210222012201001 |
4 | 2301223131133332222322 |
5 | 3100022101340000010 |
6 | 41545111433515214 |
7 | 2400100336541401 |
oct | 261533537765272 |
9 | 47207153865631 |
10 | 12210013203130 |
11 | 3988268158796 |
12 | 1452470872b0a |
13 | 6a752636ca12 |
14 | 302d7989c638 |
15 | 1629254aec3a |
hex | b1add7feaba |
12210013203130 has 32 divisors (see below), whose sum is σ = 22018446153360. Its totient is φ = 4875023301120.
The previous prime is 12210013203109. The next prime is 12210013203137. The reversal of 12210013203130 is 3130231001221.
It can be written as a sum of positive squares in 8 ways, for example, as 1686016550089 + 10523996653041 = 1298467^2 + 3244071^2 .
It is a junction number, because it is equal to n+sod(n) for n = 12210013203098 and 12210013203107.
It is not an unprimeable number, because it can be changed into a prime (12210013203137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 208116000 + ... + 208174660.
Almost surely, 212210013203130 is an apocalyptic number.
12210013203130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12210013203130 is a deficient number, since it is larger than the sum of its proper divisors (9808432950230).
12210013203130 is a wasteful number, since it uses less digits than its factorization.
12210013203130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96594.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 12210013203130 its reverse (3130231001221), we get a palindrome (15340244204351).
The spelling of 12210013203130 in words is "twelve trillion, two hundred ten billion, thirteen million, two hundred three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •