Base | Representation |
---|---|
bin | 111000011001101010… |
… | …1101010101011001001 |
3 | 102120122002101221021022 |
4 | 1300303111222223021 |
5 | 3441023310331441 |
6 | 131350354322225 |
7 | 11515322300615 |
oct | 1606325525311 |
9 | 376562357238 |
10 | 121120402121 |
11 | 47404344894 |
12 | 1b582b89375 |
13 | b56335c4c4 |
14 | 5c10076345 |
15 | 323d51b84b |
hex | 1c3356aac9 |
121120402121 has 8 divisors (see below), whose sum is σ = 122018738688. Its totient is φ = 120224818000.
The previous prime is 121120402111. The next prime is 121120402159. The reversal of 121120402121 is 121204021121.
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 121120402121 - 210 = 121120401097 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 121120402121.
It is not an unprimeable number, because it can be changed into a prime (121120402111) 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, 599735 + ... + 775836.
It is an arithmetic number, because the mean of its divisors is an integer number (15252342336).
Almost surely, 2121120402121 is an apocalyptic number.
It is an amenable number.
121120402121 is a deficient number, since it is larger than the sum of its proper divisors (898336567).
121120402121 is a wasteful number, since it uses less digits than its factorization.
121120402121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1376223.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 121120402121 its reverse (121204021121), we get a palindrome (242324423242).
The spelling of 121120402121 in words is "one hundred twenty-one billion, one hundred twenty million, four hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •