Base | Representation |
---|---|
bin | 10111001111011111111111… |
… | …010111011110010010111001 |
3 | 111101221011020021001022100222 |
4 | 113033133333113132102321 |
5 | 101344233443010132420 |
6 | 1001223152222105425 |
7 | 30350111056346621 |
oct | 2717377727362271 |
9 | 441834207038328 |
10 | 102220211020985 |
11 | 2a630391278392 |
12 | b56ab65a1b275 |
13 | 450642b0198a5 |
14 | 1b356adab9881 |
15 | bc3eb0272225 |
hex | 5cf7ff5de4b9 |
102220211020985 has 8 divisors (see below), whose sum is σ = 124042503261960. Its totient is φ = 80857335458944.
The previous prime is 102220211020979. The next prime is 102220211021051. The reversal of 102220211020985 is 589020112022201.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 104396194816 + 102115814826169 = 323104^2 + 10105237^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102220211020985 - 232 = 102215916053689 is a prime.
It is a super-2 number, since 2×1022202110209852 (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, 114854169242 + ... + 114854170131.
It is an arithmetic number, because the mean of its divisors is an integer number (15505312907745).
Almost surely, 2102220211020985 is an apocalyptic number.
It is an amenable number.
102220211020985 is a deficient number, since it is larger than the sum of its proper divisors (21822292240975).
102220211020985 is an equidigital number, since it uses as much as digits as its factorization.
102220211020985 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 229708339467.
The product of its (nonzero) digits is 11520, while the sum is 35.
The spelling of 102220211020985 in words is "one hundred two trillion, two hundred twenty billion, two hundred eleven million, twenty thousand, nine hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •