Base | Representation |
---|---|
bin | 10111001111011111111010… |
… | …000000100001110101101110 |
3 | 111101221010222222212212112221 |
4 | 113033133322000201311232 |
5 | 101344233302001320420 |
6 | 1001223135251145554 |
7 | 30350105615246140 |
oct | 2717377200416556 |
9 | 441833888785487 |
10 | 102220121120110 |
11 | 2a630345554544 |
12 | b56ab3b8a52ba |
13 | 4506415500ac6 |
14 | 1b356a1b96c90 |
15 | bc3ea7414caa |
hex | 5cf7fa021d6e |
102220121120110 has 64 divisors (see below), whose sum is σ = 211393268121600. Its totient is φ = 34861604964480.
The previous prime is 102220121120083. The next prime is 102220121120141. The reversal of 102220121120110 is 11021121022201.
It is a super-3 number, since 3×1022201211201103 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 272547232 + ... + 272922028.
It is an arithmetic number, because the mean of its divisors is an integer number (3303019814400).
Almost surely, 2102220121120110 is an apocalyptic number.
102220121120110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102220121120110 is an abundant number, since it is smaller than the sum of its proper divisors (109173147001490).
102220121120110 is a wasteful number, since it uses less digits than its factorization.
102220121120110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 395401.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 102220121120110 its reverse (11021121022201), we get a palindrome (113241242142311).
The spelling of 102220121120110 in words is "one hundred two trillion, two hundred twenty billion, one hundred twenty-one million, one hundred twenty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •