Base | Representation |
---|---|
bin | 10000000001011010100… |
… | …100010111101000110100 |
3 | 10220020221202021122102012 |
4 | 100001122210113220310 |
5 | 121014402431024340 |
6 | 2201450125503352 |
7 | 142355402012465 |
oct | 20013244275064 |
9 | 3806852248365 |
10 | 1101031111220 |
11 | 394a433a4127 |
12 | 159479111b58 |
13 | 7ca995b9161 |
14 | 3b40c3d2d6c |
15 | 1d99127a565 |
hex | 1005a917a34 |
1101031111220 has 48 divisors (see below), whose sum is σ = 2386937634816. Its totient is φ = 426172320000.
The previous prime is 1101031111211. The next prime is 1101031111223. The reversal of 1101031111220 is 221111301011.
It is a junction number, because it is equal to n+sod(n) for n = 1101031111195 and 1101031111204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101031111223) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8792045 + ... + 8916395.
It is an arithmetic number, because the mean of its divisors is an integer number (49727867392).
Almost surely, 21101031111220 is an apocalyptic number.
1101031111220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1101031111220 is an abundant number, since it is smaller than the sum of its proper divisors (1285906523596).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101031111220 is a wasteful number, since it uses less digits than its factorization.
1101031111220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 138672 (or 138670 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 1101031111220 its reverse (221111301011), we get a palindrome (1322142412231).
The spelling of 1101031111220 in words is "one trillion, one hundred one billion, thirty-one million, one hundred eleven thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •