Base | Representation |
---|---|
bin | 11101010001000110001… |
… | …110111000100011110011 |
3 | 21010021022120220101112001 |
4 | 131101012032320203303 |
5 | 230422441042020311 |
6 | 4135535412514431 |
7 | 265206660304405 |
oct | 35210616704363 |
9 | 7107276811461 |
10 | 2011223001331 |
11 | 705a55a518a5 |
12 | 28595661ba17 |
13 | 11787173a56b |
14 | 6d4b520cb75 |
15 | 374b341b4c1 |
hex | 1d4463b88f3 |
2011223001331 has 4 divisors (see below), whose sum is σ = 2022458884200. Its totient is φ = 1999987118464.
The previous prime is 2011223001329. The next prime is 2011223001367. The reversal of 2011223001331 is 1331003221102.
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 2011223001331 - 21 = 2011223001329 is a prime.
It is a super-2 number, since 2×20112230013312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2011223001299 and 2011223001308.
It is not an unprimeable number, because it can be changed into a prime (2011223001301) 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, 5617941166 + ... + 5617941523.
It is an arithmetic number, because the mean of its divisors is an integer number (505614721050).
Almost surely, 22011223001331 is an apocalyptic number.
2011223001331 is a deficient number, since it is larger than the sum of its proper divisors (11235882869).
2011223001331 is a wasteful number, since it uses less digits than its factorization.
2011223001331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11235882868.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 2011223001331 its reverse (1331003221102), we get a palindrome (3342226222433).
The spelling of 2011223001331 in words is "two trillion, eleven billion, two hundred twenty-three million, one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •