Base | Representation |
---|---|
bin | 1011000110001100101101… |
… | …1111010111111111011111 |
3 | 1121012102020002221121010002 |
4 | 2301203023133113333133 |
5 | 3044400344001321343 |
6 | 41541041225404515 |
7 | 2366334104225420 |
oct | 261431337277737 |
9 | 47172202847102 |
10 | 12201121120223 |
11 | 3984514876242 |
12 | 14507aa93973b |
13 | 6a673a0759b9 |
14 | 302774939647 |
15 | 1625a49ed8b8 |
hex | b18cb7d7fdf |
12201121120223 has 8 divisors (see below), whose sum is σ = 13950273126048. Its totient is φ = 10453502790144.
The previous prime is 12201121120189. The next prime is 12201121120261. The reversal of 12201121120223 is 32202112110221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12201121120223 - 222 = 12201116925919 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12201121120195 and 12201121120204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12201121126223) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 383401886 + ... + 383433707.
It is an arithmetic number, because the mean of its divisors is an integer number (1743784140756).
Almost surely, 212201121120223 is an apocalyptic number.
12201121120223 is a deficient number, since it is larger than the sum of its proper divisors (1749152005825).
12201121120223 is an equidigital number, since it uses as much as digits as its factorization.
12201121120223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 766837873.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 12201121120223 its reverse (32202112110221), we get a palindrome (44403233230444).
The spelling of 12201121120223 in words is "twelve trillion, two hundred one billion, one hundred twenty-one million, one hundred twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •