Base | Representation |
---|---|
bin | 110010010100010101111110… |
… | …011011101011100101001101 |
3 | 1002000120002210011212010220110 |
4 | 302110111332123223211031 |
5 | 213001241014121041023 |
6 | 2102355543123310233 |
7 | 64420264003411200 |
oct | 6224257633534515 |
9 | 1060502704763813 |
10 | 221300311112013 |
11 | 64570a31376641 |
12 | 209a159651b379 |
13 | 96636b6c588a3 |
14 | 3c90dc6893937 |
15 | 1a8b7e0301a93 |
hex | c9457e6eb94d |
221300311112013 has 24 divisors (see below), whose sum is σ = 344608794139680. Its totient is φ = 125953506588000.
The previous prime is 221300311111961. The next prime is 221300311112039. The reversal of 221300311112013 is 310211113003122.
It is not a de Polignac number, because 221300311112013 - 28 = 221300311111757 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221300311112063) 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, 2998856118 + ... + 2998929911.
It is an arithmetic number, because the mean of its divisors is an integer number (14358699755820).
Almost surely, 2221300311112013 is an apocalyptic number.
It is an amenable number.
221300311112013 is a deficient number, since it is larger than the sum of its proper divisors (123308483027667).
221300311112013 is a wasteful number, since it uses less digits than its factorization.
221300311112013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5997786297 (or 5997786290 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 221300311112013 its reverse (310211113003122), we get a palindrome (531511424115135).
The spelling of 221300311112013 in words is "two hundred twenty-one trillion, three hundred billion, three hundred eleven million, one hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •