Base | Representation |
---|---|
bin | 11011110000110010101011… |
… | …101001111110111010011110 |
3 | 121000022122222120210111122122 |
4 | 123300302223221332322132 |
5 | 112000442212302401342 |
6 | 1111404021234142542 |
7 | 34501310014300322 |
oct | 3360625351767236 |
9 | 530278876714578 |
10 | 122100210200222 |
11 | 359a545456a691 |
12 | 1183ba09421a52 |
13 | 5319000bb97b7 |
14 | 2221978859982 |
15 | e1b19003e4d2 |
hex | 6f0caba7ee9e |
122100210200222 has 16 divisors (see below), whose sum is σ = 191165066930592. Its totient is φ = 58379957180160.
The previous prime is 122100210200209. The next prime is 122100210200233. The reversal of 122100210200222 is 222002012001221.
It is a happy number.
It is a super-2 number, since 2×1221002102002222 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 122100210200222.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 358817279 + ... + 359157402.
It is an arithmetic number, because the mean of its divisors is an integer number (11947816683162).
Almost surely, 2122100210200222 is an apocalyptic number.
122100210200222 is a deficient number, since it is larger than the sum of its proper divisors (69064856730370).
122100210200222 is a wasteful number, since it uses less digits than its factorization.
122100210200222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 717978403.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 122100210200222 its reverse (222002012001221), we get a palindrome (344102222201443).
The spelling of 122100210200222 in words is "one hundred twenty-two trillion, one hundred billion, two hundred ten million, two hundred thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •