Base | Representation |
---|---|
bin | 11101010001010011011… |
… | …010000001000000100011 |
3 | 21010021212222210110201001 |
4 | 131101103122001000203 |
5 | 230423414132221311 |
6 | 4140013350052431 |
7 | 265215313045411 |
oct | 35212332010043 |
9 | 7107788713631 |
10 | 2011444023331 |
11 | 706059792a06 |
12 | 2859b864a117 |
13 | 1178a8475202 |
14 | 6d4d67042b1 |
15 | 374c7a294c1 |
hex | 1d453681023 |
2011444023331 has 32 divisors (see below), whose sum is σ = 2076237370368. Its totient is φ = 1948155740160.
The previous prime is 2011444023317. The next prime is 2011444023343. The reversal of 2011444023331 is 1333204441102.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2011444023331 is a prime.
It is a super-2 number, since 2×20114440233312 (a number of 25 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 2011444023331.
It is not an unprimeable number, because it can be changed into a prime (2011444023361) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 286812981 + ... + 286819993.
It is an arithmetic number, because the mean of its divisors is an integer number (64882417824).
Almost surely, 22011444023331 is an apocalyptic number.
2011444023331 is a deficient number, since it is larger than the sum of its proper divisors (64793347037).
2011444023331 is a wasteful number, since it uses less digits than its factorization.
2011444023331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7551.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 2011444023331 its reverse (1333204441102), we get a palindrome (3344648464433).
The spelling of 2011444023331 in words is "two trillion, eleven billion, four hundred forty-four million, twenty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •