Base | Representation |
---|---|
bin | 111000011101000000… |
… | …0001110011101000111 |
3 | 102120220212210222100011 |
4 | 1300322000032131013 |
5 | 3441240422101043 |
6 | 131405431131051 |
7 | 11521150612303 |
oct | 1607200163507 |
9 | 376825728304 |
10 | 121232222023 |
11 | 47461479830 |
12 | 1b5b4513a87 |
13 | b580581023 |
14 | 5c20c62d03 |
15 | 324825859d |
hex | 1c3a00e747 |
121232222023 has 8 divisors (see below), whose sum is σ = 133846747776. Its totient is φ = 108883265400.
The previous prime is 121232222003. The next prime is 121232222029. The reversal of 121232222023 is 320222232121.
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 121232222023 - 29 = 121232221511 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121232221985 and 121232222003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121232222029) 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, 66391323 + ... + 66393148.
It is an arithmetic number, because the mean of its divisors is an integer number (16730843472).
Almost surely, 2121232222023 is an apocalyptic number.
121232222023 is a deficient number, since it is larger than the sum of its proper divisors (12614525753).
121232222023 is a wasteful number, since it uses less digits than its factorization.
121232222023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132784565.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 121232222023 its reverse (320222232121), we get a palindrome (441454454144).
The spelling of 121232222023 in words is "one hundred twenty-one billion, two hundred thirty-two million, two hundred twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •