Base | Representation |
---|---|
bin | 111011101001000… |
… | …0001011101111111 |
3 | 12011110122011120112 |
4 | 1313102001131333 |
5 | 13044302311221 |
6 | 530324540235 |
7 | 100410014066 |
oct | 16722013577 |
9 | 5143564515 |
10 | 2001213311 |
11 | 9376a61a9 |
12 | 47a25167b |
13 | 25b7b06b6 |
14 | 14dad31dd |
15 | baa5215b |
hex | 7748177f |
2001213311 has 8 divisors (see below), whose sum is σ = 2014630464. Its totient is φ = 1987817760.
The previous prime is 2001213301. The next prime is 2001213337. The reversal of 2001213311 is 1133121002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2001213311 - 222 = 1997019007 is a prime.
It is a super-2 number, since 2×20012133112 = 8009709432247165442, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2001213301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 208265 + ... + 217661.
It is an arithmetic number, because the mean of its divisors is an integer number (251828808).
Almost surely, 22001213311 is an apocalyptic number.
2001213311 is a deficient number, since it is larger than the sum of its proper divisors (13417153).
2001213311 is a wasteful number, since it uses less digits than its factorization.
2001213311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10801.
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 2001213311 is about 44734.9227226336. The cubic root of 2001213311 is about 1260.1757777360.
Adding to 2001213311 its reverse (1133121002), we get a palindrome (3134334313).
The spelling of 2001213311 in words is "two billion, one million, two hundred thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •