Base | Representation |
---|---|
bin | 100001101000011010000… |
… | …101011010101101110011 |
3 | 22011221102121220010201001 |
4 | 201220122011122231303 |
5 | 300331143242024021 |
6 | 4525415105222431 |
7 | 325654646102302 |
oct | 41503205325563 |
9 | 8157377803631 |
10 | 2311130033011 |
11 | 81116571a678 |
12 | 313ab4931a17 |
13 | 139c28218117 |
14 | 7dc05c70439 |
15 | 401b7864091 |
hex | 21a1a15ab73 |
2311130033011 has 4 divisors (see below), whose sum is σ = 2311136962024. Its totient is φ = 2311123104000.
The previous prime is 2311130032999. The next prime is 2311130033087. The reversal of 2311130033011 is 1103300311132.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2311130033011 - 241 = 112106777459 is a prime.
It is a super-2 number, since 2×23111300330112 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2311130033011.
It is not an unprimeable number, because it can be changed into a prime (2311130033111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2937465 + ... + 3640186.
It is an arithmetic number, because the mean of its divisors is an integer number (577784240506).
Almost surely, 22311130033011 is an apocalyptic number.
2311130033011 is a deficient number, since it is larger than the sum of its proper divisors (6929013).
2311130033011 is an equidigital number, since it uses as much as digits as its factorization.
2311130033011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6929012.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 2311130033011 its reverse (1103300311132), we get a palindrome (3414430344143).
The spelling of 2311130033011 in words is "two trillion, three hundred eleven billion, one hundred thirty million, thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •