Base | Representation |
---|---|
bin | 11011101111011110110001… |
… | …110111111100011100011001 |
3 | 121000000001110001120211102120 |
4 | 123233132301313330130121 |
5 | 111443003211233211301 |
6 | 1111254401521051453 |
7 | 34461640343102226 |
oct | 3357366167743431 |
9 | 530001401524376 |
10 | 122010120210201 |
11 | 35970224074783 |
12 | 11826466486b89 |
13 | 5310674549cb2 |
14 | 221b46da1494d |
15 | e18b6ad38e36 |
hex | 6ef7b1dfc719 |
122010120210201 has 8 divisors (see below), whose sum is σ = 162680221357920. Its totient is φ = 81340049601312.
The previous prime is 122010120210179. The next prime is 122010120210233. The reversal of 122010120210201 is 102012021010221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122010120210201 - 222 = 122010116015897 is a prime.
It is not an unprimeable number, because it can be changed into a prime (122010120210001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4395645 + ... + 16227813.
It is an arithmetic number, because the mean of its divisors is an integer number (20335027669740).
Almost surely, 2122010120210201 is an apocalyptic number.
It is an amenable number.
122010120210201 is a deficient number, since it is larger than the sum of its proper divisors (40670101147719).
122010120210201 is a wasteful number, since it uses less digits than its factorization.
122010120210201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15269415.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 122010120210201 its reverse (102012021010221), we get a palindrome (224022141220422).
The spelling of 122010120210201 in words is "one hundred twenty-two trillion, ten billion, one hundred twenty million, two hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •