Base | Representation |
---|---|
bin | 111000011100000110… |
… | …1000001001010011111 |
3 | 102120211202222121100121 |
4 | 1300320031001022133 |
5 | 3441210204133043 |
6 | 131402431535411 |
7 | 11520333115606 |
oct | 1607015011237 |
9 | 376752877317 |
10 | 121202021023 |
11 | 47446421326 |
12 | 1b5a638a567 |
13 | b577238705 |
14 | 5c1ac40a3d |
15 | 324578eded |
hex | 1c3834129f |
121202021023 has 8 divisors (see below), whose sum is σ = 122325074960. Its totient is φ = 120079169280.
The previous prime is 121202021009. The next prime is 121202021051. The reversal of 121202021023 is 320120202121.
It is a happy number.
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-121202021023 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121202020988 and 121202021006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121202021723) 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 7 ways as a sum of consecutive naturals, for example, 1326688 + ... + 1415098.
It is an arithmetic number, because the mean of its divisors is an integer number (15290634370).
Almost surely, 2121202021023 is an apocalyptic number.
121202021023 is a deficient number, since it is larger than the sum of its proper divisors (1123053937).
121202021023 is a wasteful number, since it uses less digits than its factorization.
121202021023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101097.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 121202021023 its reverse (320120202121), we get a palindrome (441322223144).
The spelling of 121202021023 in words is "one hundred twenty-one billion, two hundred two million, twenty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •