Base | Representation |
---|---|
bin | 10111001111100000110101… |
… | …000100011110100100001100 |
3 | 111101221020120001102100100021 |
4 | 113033200311010132210030 |
5 | 101344242314133323040 |
6 | 1001223421445311524 |
7 | 30350142306551002 |
oct | 2717406504364414 |
9 | 441836501370307 |
10 | 102221112011020 |
11 | 2a630803916552 |
12 | b56b1777055a4 |
13 | 450654289baa2 |
14 | 1b35757612a72 |
15 | bc40143e724a |
hex | 5cf83511e90c |
102221112011020 has 12 divisors (see below), whose sum is σ = 214664335223184. Its totient is φ = 40888444804400.
The previous prime is 102221112011003. The next prime is 102221112011059. The reversal of 102221112011020 is 20110211122201.
It is a junction number, because it is equal to n+sod(n) for n = 102221112010985 and 102221112011003.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2555527800256 + ... + 2555527800295.
It is an arithmetic number, because the mean of its divisors is an integer number (17888694601932).
Almost surely, 2102221112011020 is an apocalyptic number.
102221112011020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102221112011020 is an abundant number, since it is smaller than the sum of its proper divisors (112443223212164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102221112011020 is a wasteful number, since it uses less digits than its factorization.
102221112011020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5111055600560 (or 5111055600558 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 102221112011020 its reverse (20110211122201), we get a palindrome (122331323133221).
The spelling of 102221112011020 in words is "one hundred two trillion, two hundred twenty-one billion, one hundred twelve million, eleven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •