Base | Representation |
---|---|
bin | 11011110000111100000000… |
… | …010011001000111110110110 |
3 | 121000100121211012101200202022 |
4 | 123300330000103020332312 |
5 | 112001123212333210402 |
6 | 1111412354415313142 |
7 | 34502113043052515 |
oct | 3360740023107666 |
9 | 530317735350668 |
10 | 122110220210102 |
11 | 359a97209a1223 |
12 | 1184194181b7b2 |
13 | 5319c379a0177 |
14 | 222224806667c |
15 | e1b578c282a2 |
hex | 6f0f004c8fb6 |
122110220210102 has 8 divisors (see below), whose sum is σ = 193939761510216. Its totient is φ = 57463633040032.
The previous prime is 122110220210101. The next prime is 122110220210107. The reversal of 122110220210102 is 201012022011221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122110220210101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1795738532468 + ... + 1795738532535.
It is an arithmetic number, because the mean of its divisors is an integer number (24242470188777).
Almost surely, 2122110220210102 is an apocalyptic number.
122110220210102 is a deficient number, since it is larger than the sum of its proper divisors (71829541300114).
122110220210102 is a wasteful number, since it uses less digits than its factorization.
122110220210102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3591477065022.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 122110220210102 its reverse (201012022011221), we get a palindrome (323122242221323).
The spelling of 122110220210102 in words is "one hundred twenty-two trillion, one hundred ten billion, two hundred twenty million, two hundred ten thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •