Base | Representation |
---|---|
bin | 10001110010010001111… |
… | …111101101100010111101 |
3 | 11022211202121202122121222 |
4 | 101302101333231202331 |
5 | 130011101322010023 |
6 | 2333251414403125 |
7 | 154205516343620 |
oct | 21622177554275 |
9 | 4284677678558 |
10 | 1222220110013 |
11 | 431382430681 |
12 | 178a5b0604a5 |
13 | 8b340c154b6 |
14 | 43227603db7 |
15 | 21bd57e6cc8 |
hex | 11c91fed8bd |
1222220110013 has 24 divisors (see below), whose sum is σ = 1481028000192. Its totient is φ = 984635253504.
The previous prime is 1222220109997. The next prime is 1222220110043. The reversal of 1222220110013 is 3100110222221.
It is not a de Polignac number, because 1222220110013 - 24 = 1222220109997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1222220109973 and 1222220110000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1222220110043) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 68183870 + ... + 68201792.
It is an arithmetic number, because the mean of its divisors is an integer number (61709500008).
Almost surely, 21222220110013 is an apocalyptic number.
It is an amenable number.
1222220110013 is a deficient number, since it is larger than the sum of its proper divisors (258807890179).
1222220110013 is an frugal number, since it uses more digits than its factorization.
1222220110013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19461 (or 18704 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 1222220110013 its reverse (3100110222221), we get a palindrome (4322330332234).
The spelling of 1222220110013 in words is "one trillion, two hundred twenty-two billion, two hundred twenty million, one hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •