Base | Representation |
---|---|
bin | 11101011011100000100… |
… | …10100010111001111001 |
3 | 10120200002100111120120210 |
4 | 32231300102202321321 |
5 | 113031420003134223 |
6 | 2052312303341333 |
7 | 133025336405460 |
oct | 16556022427171 |
9 | 3520070446523 |
10 | 1011201224313 |
11 | 35a936802575 |
12 | 143b892b1849 |
13 | 74481ab8817 |
14 | 36d29d379d7 |
15 | 1b484d02893 |
hex | eb704a2e79 |
1011201224313 has 16 divisors (see below), whose sum is σ = 1554514148736. Its totient is φ = 572715736320.
The previous prime is 1011201224309. The next prime is 1011201224321. The reversal of 1011201224313 is 3134221021101.
It is not a de Polignac number, because 1011201224313 - 22 = 1011201224309 is a prime.
It is a super-2 number, since 2×10112012243132 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 1011201224313.
It is not an unprimeable number, because it can be changed into a prime (1011201324313) 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, 213061518 + ... + 213066263.
It is an arithmetic number, because the mean of its divisors is an integer number (97157134296).
Almost surely, 21011201224313 is an apocalyptic number.
It is an amenable number.
1011201224313 is a deficient number, since it is larger than the sum of its proper divisors (543312924423).
1011201224313 is a wasteful number, since it uses less digits than its factorization.
1011201224313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 426127904.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 1011201224313 its reverse (3134221021101), we get a palindrome (4145422245414).
The spelling of 1011201224313 in words is "one trillion, eleven billion, two hundred one million, two hundred twenty-four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •