Base | Representation |
---|---|
bin | 100011010111101000111010… |
… | …0111000100000011011100011 |
3 | 1111210120000222222022122122210 |
4 | 1012233101310320200123203 |
5 | 311234230302234214021 |
6 | 3021402551020533203 |
7 | 122350054432266510 |
oct | 10657216470403343 |
9 | 1453500888278583 |
10 | 311112212023011 |
11 | 90147a48010133 |
12 | 2aa8776a3b1203 |
13 | 104799a93a6a09 |
14 | 56b7ca8c7c307 |
15 | 25e7b21404e76 |
hex | 11af474e206e3 |
311112212023011 has 16 divisors (see below), whose sum is σ = 475041282732288. Its totient is φ = 177416332716000.
The previous prime is 311112212022869. The next prime is 311112212023013. The reversal of 311112212023011 is 110320212211113.
It is not a de Polignac number, because 311112212023011 - 29 = 311112212022499 is a prime.
It is a super-2 number, since 2×3111122120230112 (a number of 30 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (311112212023013) 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, 15086412540 + ... + 15086433161.
It is an arithmetic number, because the mean of its divisors is an integer number (29690080170768).
Almost surely, 2311112212023011 is an apocalyptic number.
311112212023011 is a deficient number, since it is larger than the sum of its proper divisors (163929070709277).
311112212023011 is a wasteful number, since it uses less digits than its factorization.
311112212023011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30172846202.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 311112212023011 its reverse (110320212211113), we get a palindrome (421432424234124).
The spelling of 311112212023011 in words is "three hundred eleven trillion, one hundred twelve billion, two hundred twelve million, twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •