Base | Representation |
---|---|
bin | 1011000000011111111100… |
… | …0100101110000100111110 |
3 | 1120212001110222102011010002 |
4 | 2300013333010232010332 |
5 | 3041244324242101342 |
6 | 41424045005314302 |
7 | 2356266431051165 |
oct | 260077704560476 |
9 | 46761428364102 |
10 | 12103202300222 |
11 | 3946a37194510 |
12 | 1435821b65992 |
13 | 69a433794b17 |
14 | 2dbb260663dc |
15 | 15ec7335ed32 |
hex | b01ff12e13e |
12103202300222 has 8 divisors (see below), whose sum is σ = 19805240127672. Its totient is φ = 5501455591000.
The previous prime is 12103202300191. The next prime is 12103202300237. The reversal of 12103202300222 is 22200320230121.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×121032023002222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12103202300194 and 12103202300203.
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 3 ways as a sum of consecutive naturals, for example, 275072779529 + ... + 275072779572.
It is an arithmetic number, because the mean of its divisors is an integer number (2475655015959).
Almost surely, 212103202300222 is an apocalyptic number.
12103202300222 is a deficient number, since it is larger than the sum of its proper divisors (7702037827450).
12103202300222 is a wasteful number, since it uses less digits than its factorization.
12103202300222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 550145559114.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 12103202300222 its reverse (22200320230121), we get a palindrome (34303522530343).
The spelling of 12103202300222 in words is "twelve trillion, one hundred three billion, two hundred two million, three hundred thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •