Base | Representation |
---|---|
bin | 111000011001101111… |
… | …1100101011100010101 |
3 | 102120122021022000211001 |
4 | 1300303133211130111 |
5 | 3441024442032013 |
6 | 131350530143301 |
7 | 11515353350050 |
oct | 1606337453425 |
9 | 376567260731 |
10 | 121123002133 |
11 | 47405860261 |
12 | 1b583a21b31 |
13 | b563a5ca83 |
14 | 5c10551a97 |
15 | 323d881ddd |
hex | 1c337e5715 |
121123002133 has 4 divisors (see below), whose sum is σ = 138426288160. Its totient is φ = 103819716108.
The previous prime is 121123002079. The next prime is 121123002149. The reversal of 121123002133 is 331200321121.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 121123002133 - 29 = 121123001621 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 121123002133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121123002173) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8651643003 + ... + 8651643016.
It is an arithmetic number, because the mean of its divisors is an integer number (34606572040).
Almost surely, 2121123002133 is an apocalyptic number.
It is an amenable number.
121123002133 is a deficient number, since it is larger than the sum of its proper divisors (17303286027).
121123002133 is an equidigital number, since it uses as much as digits as its factorization.
121123002133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17303286026.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 121123002133 its reverse (331200321121), we get a palindrome (452323323254).
The spelling of 121123002133 in words is "one hundred twenty-one billion, one hundred twenty-three million, two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •