Base | Representation |
---|---|
bin | 11101010001001100101… |
… | …001000111111001110111 |
3 | 21010021121002021002021002 |
4 | 131101030221013321313 |
5 | 230423201104340343 |
6 | 4135554213513515 |
7 | 265212434350541 |
oct | 35211451077167 |
9 | 7107532232232 |
10 | 2011330543223 |
11 | 7060007246a1 |
12 | 28598664289b |
13 | 11788aac1b11 |
14 | 6d4c5604691 |
15 | 374bcab08b8 |
hex | 1d44ca47e77 |
2011330543223 has 4 divisors (see below), whose sum is σ = 2049280176168. Its totient is φ = 1973380910280.
The previous prime is 2011330543207. The next prime is 2011330543247. The reversal of 2011330543223 is 3223450331102.
It is a happy number.
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 2011330543223 - 24 = 2011330543207 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011330545223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18974816393 + ... + 18974816498.
It is an arithmetic number, because the mean of its divisors is an integer number (512320044042).
Almost surely, 22011330543223 is an apocalyptic number.
2011330543223 is a deficient number, since it is larger than the sum of its proper divisors (37949632945).
2011330543223 is an equidigital number, since it uses as much as digits as its factorization.
2011330543223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37949632944.
The product of its (nonzero) digits is 12960, while the sum is 29.
Adding to 2011330543223 its reverse (3223450331102), we get a palindrome (5234780874325).
The spelling of 2011330543223 in words is "two trillion, eleven billion, three hundred thirty million, five hundred forty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •