Base | Representation |
---|---|
bin | 10001110010001011011… |
… | …111111010001101111101 |
3 | 11022211111000122212201221 |
4 | 101302023133322031331 |
5 | 130010340421010023 |
6 | 2333232522233341 |
7 | 154203024015433 |
oct | 21621337721575 |
9 | 4284430585657 |
10 | 1222111110013 |
11 | 431326952332 |
12 | 178a2a655851 |
13 | 8b324470361 |
14 | 43216d4cd53 |
15 | 21bcae6585d |
hex | 11c8b7fa37d |
1222111110013 has 8 divisors (see below), whose sum is σ = 1233575461728. Its totient is φ = 1210647550224.
The previous prime is 1222111109971. The next prime is 1222111110029. The reversal of 1222111110013 is 3100111112221.
It is a happy number.
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 1222111110013 - 213 = 1222111101821 is a prime.
It is a super-3 number, since 3×12221111100133 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1222111110613) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3170370 + ... + 3534892.
It is an arithmetic number, because the mean of its divisors is an integer number (154196932716).
Almost surely, 21222111110013 is an apocalyptic number.
It is an amenable number.
1222111110013 is a deficient number, since it is larger than the sum of its proper divisors (11464351715).
1222111110013 is a wasteful number, since it uses less digits than its factorization.
1222111110013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 395963.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 1222111110013 its reverse (3100111112221), we get a palindrome (4322222222234).
The spelling of 1222111110013 in words is "one trillion, two hundred twenty-two billion, one hundred eleven million, one hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •