Base | Representation |
---|---|
bin | 111000010110011010… |
… | …0011000001001111111 |
3 | 102120100110120100112121 |
4 | 1300230310120021333 |
5 | 3440312304342343 |
6 | 131331445543411 |
7 | 11512523426623 |
oct | 1605464301177 |
9 | 376313510477 |
10 | 121011012223 |
11 | 4735861a612 |
12 | 1b552414b67 |
13 | b5467aba5a |
14 | 5bdd71d183 |
15 | 3233b0eaed |
hex | 1c2cd1827f |
121011012223 has 8 divisors (see below), whose sum is σ = 124022099376. Its totient is φ = 118002763200.
The previous prime is 121011012197. The next prime is 121011012233. The reversal of 121011012223 is 322210110121.
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-121011012223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121011012197 and 121011012206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121011012233) 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, 623068 + ... + 793873.
It is an arithmetic number, because the mean of its divisors is an integer number (15502762422).
Almost surely, 2121011012223 is an apocalyptic number.
121011012223 is a deficient number, since it is larger than the sum of its proper divisors (3011087153).
121011012223 is a wasteful number, since it uses less digits than its factorization.
121011012223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1419065.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 121011012223 its reverse (322210110121), we get a palindrome (443221122344).
The spelling of 121011012223 in words is "one hundred twenty-one billion, eleven million, twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •