Base | Representation |
---|---|
bin | 1011000110101101110101… |
… | …0100111010001001100110 |
3 | 1121020021011121111202202212 |
4 | 2301223131110322021212 |
5 | 3100022100114113110 |
6 | 41545111251403422 |
7 | 2400100303063433 |
oct | 261533524721146 |
9 | 47207147452685 |
10 | 12210010301030 |
11 | 3988266556363 |
12 | 145246b8b3572 |
13 | 6a7525894ab9 |
14 | 302d79344b8a |
15 | 1629250d9e05 |
hex | b1add53a266 |
12210010301030 has 16 divisors (see below), whose sum is σ = 21978071787600. Its totient is φ = 4883992288032.
The previous prime is 12210010301029. The next prime is 12210010301051. The reversal of 12210010301030 is 3010301001221.
It is a super-2 number, since 2×122100103010302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12210010300996 and 12210010301014.
It is a congruent number.
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, 3727892 + ... + 6190088.
It is an arithmetic number, because the mean of its divisors is an integer number (1373629486725).
Almost surely, 212210010301030 is an apocalyptic number.
12210010301030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12210010301030 is a deficient number, since it is larger than the sum of its proper divisors (9768061486570).
12210010301030 is a wasteful number, since it uses less digits than its factorization.
12210010301030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2958103.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 12210010301030 its reverse (3010301001221), we get a palindrome (15220311302251).
The spelling of 12210010301030 in words is "twelve trillion, two hundred ten billion, ten million, three hundred one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •