Base | Representation |
---|---|
bin | 111000100010000100… |
… | …0101011011101001011 |
3 | 102121100201200021011201 |
4 | 1301010020223131023 |
5 | 3442112431210443 |
6 | 131434342405031 |
7 | 11525313521365 |
oct | 1610410533513 |
9 | 377321607151 |
10 | 121402210123 |
11 | 47539423367 |
12 | 1b641430777 |
13 | b5a985aabc |
14 | 5c39671d35 |
15 | 325813534d |
hex | 1c4422b74b |
121402210123 has 4 divisors (see below), whose sum is σ = 122938947040. Its totient is φ = 119865473208.
The previous prime is 121402210099. The next prime is 121402210129. The reversal of 121402210123 is 321012204121.
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 121402210123 - 25 = 121402210091 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 121402210123.
It is not an unprimeable number, because it can be changed into a prime (121402210129) 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, 768368340 + ... + 768368497.
It is an arithmetic number, because the mean of its divisors is an integer number (30734736760).
Almost surely, 2121402210123 is an apocalyptic number.
121402210123 is a deficient number, since it is larger than the sum of its proper divisors (1536736917).
121402210123 is an equidigital number, since it uses as much as digits as its factorization.
121402210123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1536736916.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 121402210123 its reverse (321012204121), we get a palindrome (442414414244).
The spelling of 121402210123 in words is "one hundred twenty-one billion, four hundred two million, two hundred ten thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •