Base | Representation |
---|---|
bin | 111000011100011011… |
… | …1010111011010101111 |
3 | 102120212112212121100011 |
4 | 1300320313113122233 |
5 | 3441221024402343 |
6 | 131403505514051 |
7 | 11520526352614 |
oct | 1607067273257 |
9 | 376775777304 |
10 | 121213122223 |
11 | 47451713876 |
12 | 1b5aa042927 |
13 | b57962457b |
14 | 5c1c4d050b |
15 | 324673429d |
hex | 1c38dd76af |
121213122223 has 8 divisors (see below), whose sum is σ = 122855205600. Its totient is φ = 119579704800.
The previous prime is 121213122197. The next prime is 121213122253. The reversal of 121213122223 is 322221312121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121213122223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121213122194 and 121213122203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121213122253) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 2138323 + ... + 2194276.
It is an arithmetic number, because the mean of its divisors is an integer number (15356900700).
Almost surely, 2121213122223 is an apocalyptic number.
121213122223 is a deficient number, since it is larger than the sum of its proper divisors (1642083377).
121213122223 is a wasteful number, since it uses less digits than its factorization.
121213122223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4332977.
The product of its digits is 576, while the sum is 22.
Adding to 121213122223 its reverse (322221312121), we get a palindrome (443434434344).
The spelling of 121213122223 in words is "one hundred twenty-one billion, two hundred thirteen million, one hundred twenty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •