Base | Representation |
---|---|
bin | 11011110010010001100000… |
… | …000111001011100101101000 |
3 | 121000200101210000122212022212 |
4 | 123302101200013023211220 |
5 | 112004124220113013000 |
6 | 1111522500042304252 |
7 | 34511543011312664 |
oct | 3362214007134550 |
9 | 530611700585285 |
10 | 122202022001000 |
11 | 35a3464a68a4a7 |
12 | 118576a1ab8088 |
13 | 53257a7b8b6b6 |
14 | 22268763858a4 |
15 | e1db4d363c35 |
hex | 6f24601cb968 |
122202022001000 has 32 divisors (see below), whose sum is σ = 285952731484680. Its totient is φ = 48880808800000.
The previous prime is 122202022000909. The next prime is 122202022001099. The reversal of 122202022001000 is 100220202221.
It can be written as a sum of positive squares in 4 ways, for example, as 13605489627844 + 108596532373156 = 3688562^2 + 10420966^2 .
It is a super-2 number, since 2×1222020220010002 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 61101010001 + ... + 61101012000.
Almost surely, 2122202022001000 is an apocalyptic number.
122202022001000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
122202022001000 is an abundant number, since it is smaller than the sum of its proper divisors (163750709483680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122202022001000 is a wasteful number, since it uses less digits than its factorization.
122202022001000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122202022022 (or 122202022008 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 122202022001000 its reverse (100220202221), we get a palindrome (122302242203221).
The spelling of 122202022001000 in words is "one hundred twenty-two trillion, two hundred two billion, twenty-two million, one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •