Base | Representation |
---|---|
bin | 1011000110001100101101… |
… | …1111000010000001001111 |
3 | 1121012102020002210000122202 |
4 | 2301203023133002001033 |
5 | 3044400343440431343 |
6 | 41541041223432115 |
7 | 2366334103402136 |
oct | 261431337020117 |
9 | 47172202700582 |
10 | 12201121030223 |
11 | 3984514814664 |
12 | 14507aa8b563b |
13 | 6a673a043a48 |
14 | 30277491491d |
15 | 1625a49d1db8 |
hex | b18cb7c204f |
12201121030223 has 4 divisors (see below), whose sum is σ = 12621849341640. Its totient is φ = 11780392718808.
The previous prime is 12201121030199. The next prime is 12201121030261. The reversal of 12201121030223 is 32203012110221.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12201121030223 - 216 = 12201120964687 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12201121030195 and 12201121030204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12201121030523) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 210364155665 + ... + 210364155722.
It is an arithmetic number, because the mean of its divisors is an integer number (3155462335410).
Almost surely, 212201121030223 is an apocalyptic number.
12201121030223 is a deficient number, since it is larger than the sum of its proper divisors (420728311417).
12201121030223 is an equidigital number, since it uses as much as digits as its factorization.
12201121030223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 420728311416.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 12201121030223 its reverse (32203012110221), we get a palindrome (44404133140444).
The spelling of 12201121030223 in words is "twelve trillion, two hundred one billion, one hundred twenty-one million, thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •