Base | Representation |
---|---|
bin | 11101010001001011101… |
… | …010001001001100100011 |
3 | 21010021112221012022002202 |
4 | 131101023222021030203 |
5 | 230423132343032233 |
6 | 4135552424003415 |
7 | 265212144126221 |
oct | 35211352111443 |
9 | 7107487168082 |
10 | 2011314033443 |
11 | 705aa2378650 |
12 | 28598100056b |
13 | 117887561210 |
14 | 6d4c3347b11 |
15 | 374bb3edbe8 |
hex | 1d44ba89323 |
2011314033443 has 16 divisors (see below), whose sum is σ = 2439166313472. Its totient is φ = 1633370292000.
The previous prime is 2011314033433. The next prime is 2011314033457. The reversal of 2011314033443 is 3443304131102.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 2011314033443 - 216 = 2011313967907 is a prime.
It is a super-2 number, since 2×20113140334432 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2011314033433) 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 15 ways as a sum of consecutive naturals, for example, 226852553 + ... + 226861418.
It is an arithmetic number, because the mean of its divisors is an integer number (152447894592).
Almost surely, 22011314033443 is an apocalyptic number.
2011314033443 is a deficient number, since it is larger than the sum of its proper divisors (427852280029).
2011314033443 is a wasteful number, since it uses less digits than its factorization.
2011314033443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 453714026.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 2011314033443 its reverse (3443304131102), we get a palindrome (5454618164545).
The spelling of 2011314033443 in words is "two trillion, eleven billion, three hundred fourteen million, thirty-three thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •