Base | Representation |
---|---|
bin | 11011101111011110110110… |
… | …101000011001100010000001 |
3 | 121000000001122121202122102120 |
4 | 123233132312220121202001 |
5 | 111443003342201133441 |
6 | 1111254413451434453 |
7 | 34461642332350146 |
oct | 3357366650314201 |
9 | 530001577678376 |
10 | 122010200021121 |
11 | 35970265126915 |
12 | 11826489155a29 |
13 | 5310687c422a9 |
14 | 221b47a46c3cd |
15 | e18b72d51966 |
hex | 6ef7b6a19881 |
122010200021121 has 8 divisors (see below), whose sum is σ = 165347156313024. Its totient is φ = 80006688538320.
The previous prime is 122010200021113. The next prime is 122010200021153. The reversal of 122010200021121 is 121120002010221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122010200021121 - 23 = 122010200021113 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 122010200021121.
It is not an unprimeable number, because it can be changed into a prime (122010200021321) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 333361202061 + ... + 333361202426.
It is an arithmetic number, because the mean of its divisors is an integer number (20668394539128).
Almost surely, 2122010200021121 is an apocalyptic number.
It is an amenable number.
122010200021121 is a deficient number, since it is larger than the sum of its proper divisors (43336956291903).
122010200021121 is an equidigital number, since it uses as much as digits as its factorization.
122010200021121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 666722404551.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 122010200021121 its reverse (121120002010221), we get a palindrome (243130202031342).
The spelling of 122010200021121 in words is "one hundred twenty-two trillion, ten billion, two hundred million, twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •