Base | Representation |
---|---|
bin | 111000011100011011… |
… | …1110000000110000101 |
3 | 102120212120001201222210 |
4 | 1300320313300012011 |
5 | 3441221041121201 |
6 | 131403512014033 |
7 | 11520530253402 |
oct | 1607067600605 |
9 | 376776051883 |
10 | 121213223301 |
11 | 47451782805 |
12 | 1b5aa091319 |
13 | b57965b591 |
14 | 5c1c5192a9 |
15 | 32467541d6 |
hex | 1c38df0185 |
121213223301 has 4 divisors (see below), whose sum is σ = 161617631072. Its totient is φ = 80808815532.
The previous prime is 121213223269. The next prime is 121213223347. The reversal of 121213223301 is 103322312121.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 121213223301 - 25 = 121213223269 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121213223371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20202203881 + ... + 20202203886.
It is an arithmetic number, because the mean of its divisors is an integer number (40404407768).
Almost surely, 2121213223301 is an apocalyptic number.
It is an amenable number.
121213223301 is a deficient number, since it is larger than the sum of its proper divisors (40404407771).
121213223301 is an equidigital number, since it uses as much as digits as its factorization.
121213223301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40404407770.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 121213223301 its reverse (103322312121), we get a palindrome (224535535422).
The spelling of 121213223301 in words is "one hundred twenty-one billion, two hundred thirteen million, two hundred twenty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •