Base | Representation |
---|---|
bin | 1011000110010100110101… |
… | …1100001000111100010110 |
3 | 1121012121212001100201120010 |
4 | 2301211031130020330112 |
5 | 3044414330113411410 |
6 | 41542041430421050 |
7 | 2366442116436462 |
oct | 261451534107426 |
9 | 47177761321503 |
10 | 12203301310230 |
11 | 39854334a5268 |
12 | 14510b8b01786 |
13 | 6a69c695c564 |
14 | 3029002db4a2 |
15 | 162681105c20 |
hex | b194d708f16 |
12203301310230 has 64 divisors (see below), whose sum is σ = 29453636855808. Its totient is φ = 3235846803840.
The previous prime is 12203301310217. The next prime is 12203301310259. The reversal of 12203301310230 is 3201310330221.
It is a super-2 number, since 2×122033013102302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12203301310197 and 12203301310206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2839027 + ... + 5697953.
It is an arithmetic number, because the mean of its divisors is an integer number (460213075872).
Almost surely, 212203301310230 is an apocalyptic number.
12203301310230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12203301310230 is an abundant number, since it is smaller than the sum of its proper divisors (17250335545578).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12203301310230 is a wasteful number, since it uses less digits than its factorization.
12203301310230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2859741.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 12203301310230 its reverse (3201310330221), we get a palindrome (15404611640451).
The spelling of 12203301310230 in words is "twelve trillion, two hundred three billion, three hundred one million, three hundred ten thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •