Base | Representation |
---|---|
bin | 11011100010100011101001… |
… | …110010100110011100110111 |
3 | 120212212011001102220211202002 |
4 | 123202203221302212130313 |
5 | 111333430324011300343 |
6 | 1105334402333005515 |
7 | 34340530034540300 |
oct | 3342435162463467 |
9 | 525764042824662 |
10 | 121122000103223 |
11 | 35658608461399 |
12 | 1170230892389b |
13 | 52779a9091bb2 |
14 | 21ca49c3037a7 |
15 | e009db7558b8 |
hex | 6e28e9ca6737 |
121122000103223 has 12 divisors (see below), whose sum is σ = 141157458674712. Its totient is φ = 103626955439280.
The previous prime is 121122000103219. The next prime is 121122000103231. The reversal of 121122000103223 is 322301000221121.
It is not a de Polignac number, because 121122000103223 - 22 = 121122000103219 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121122000103195 and 121122000103204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121122000109223) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2284518365 + ... + 2284571382.
It is an arithmetic number, because the mean of its divisors is an integer number (11763121556226).
Almost surely, 2121122000103223 is an apocalyptic number.
121122000103223 is a deficient number, since it is larger than the sum of its proper divisors (20035458571489).
121122000103223 is an equidigital number, since it uses as much as digits as its factorization.
121122000103223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4569090302 (or 4569090295 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 121122000103223 its reverse (322301000221121), we get a palindrome (443423000324344).
The spelling of 121122000103223 in words is "one hundred twenty-one trillion, one hundred twenty-two billion, one hundred three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •