Base | Representation |
---|---|
bin | 111000010110101111… |
… | …0011000011010000111 |
3 | 102120101020021202220101 |
4 | 1300231132120122013 |
5 | 3440323114221203 |
6 | 131332521544531 |
7 | 11513016140116 |
oct | 1605536303207 |
9 | 376336252811 |
10 | 121022023303 |
11 | 47363860385 |
12 | 1b556045147 |
13 | b548b6589c |
14 | 5c00d87c7d |
15 | 3234a8741d |
hex | 1c2d798687 |
121022023303 has 8 divisors (see below), whose sum is σ = 122496579296. Its totient is φ = 119556324000.
The previous prime is 121022023123. The next prime is 121022023307. The reversal of 121022023303 is 303320220121.
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 121022023303 - 29 = 121022022791 is a prime.
It is a super-4 number, since 4×1210220233034 (a number of 45 digits) contains 4444 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121022023307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2186676 + ... + 2241337.
It is an arithmetic number, because the mean of its divisors is an integer number (15312072412).
Almost surely, 2121022023303 is an apocalyptic number.
121022023303 is a deficient number, since it is larger than the sum of its proper divisors (1474555993).
121022023303 is a wasteful number, since it uses less digits than its factorization.
121022023303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4428345.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 121022023303 its reverse (303320220121), we get a palindrome (424342243424).
The spelling of 121022023303 in words is "one hundred twenty-one billion, twenty-two million, twenty-three thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •