Base | Representation |
---|---|
bin | 11011101111101001110110… |
… | …000001100100011011100010 |
3 | 121000001012010001101121011020 |
4 | 123233221312001210123202 |
5 | 111443202024224032320 |
6 | 1111304044451430310 |
7 | 34462540636133631 |
oct | 3357516601443342 |
9 | 530035101347136 |
10 | 122022001002210 |
11 | 35975270505651 |
12 | 118288212b5396 |
13 | 5311818aa423a |
14 | 221bc79881518 |
15 | e19113dad940 |
hex | 6efa760646e2 |
122022001002210 has 32 divisors (see below), whose sum is σ = 292863026563200. Its totient is φ = 32538064249728.
The previous prime is 122022001002203. The next prime is 122022001002299. The reversal of 122022001002210 is 12200100220221.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 122022001002210.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 70127302 + ... + 71846241.
It is an arithmetic number, because the mean of its divisors is an integer number (9151969580100).
Almost surely, 2122022001002210 is an apocalyptic number.
122022001002210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
122022001002210 is an abundant number, since it is smaller than the sum of its proper divisors (170841025560990).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122022001002210 is a wasteful number, since it uses less digits than its factorization.
122022001002210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142002202.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 122022001002210 its reverse (12200100220221), we get a palindrome (134222101222431).
The spelling of 122022001002210 in words is "one hundred twenty-two trillion, twenty-two billion, one million, two thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •