Base | Representation |
---|---|
bin | 1011001101101101101001… |
… | …1000111001101010000110 |
3 | 1121122202110020110021200001 |
4 | 2303123122120321222012 |
5 | 3104004242321201410 |
6 | 42120231440511514 |
7 | 2411554230365344 |
oct | 263333230715206 |
9 | 47582406407601 |
10 | 12330220100230 |
11 | 3a2424288674a |
12 | 147181991b59a |
13 | 6b59723877b6 |
14 | 308b004a0994 |
15 | 165b0d6d333a |
hex | b36da639a86 |
12330220100230 has 32 divisors (see below), whose sum is σ = 22223555855424. Its totient is φ = 4925608849536.
The previous prime is 12330220100161. The next prime is 12330220100273. The reversal of 12330220100230 is 3200102203321.
It is a super-2 number, since 2×123302201002302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12330220100198 and 12330220100207.
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 15 ways as a sum of consecutive naturals, for example, 178915959 + ... + 178984861.
It is an arithmetic number, because the mean of its divisors is an integer number (694486120482).
Almost surely, 212330220100230 is an apocalyptic number.
12330220100230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12330220100230 is a deficient number, since it is larger than the sum of its proper divisors (9893335755194).
12330220100230 is a wasteful number, since it uses less digits than its factorization.
12330220100230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92160.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 12330220100230 its reverse (3200102203321), we get a palindrome (15530322303551).
The spelling of 12330220100230 in words is "twelve trillion, three hundred thirty billion, two hundred twenty million, one hundred thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •