Base | Representation |
---|---|
bin | 11101010000111001101… |
… | …110010000100100010011 |
3 | 21010020202221222102122110 |
4 | 131100321232100210103 |
5 | 230422023324403243 |
6 | 4135502514240403 |
7 | 265201531333302 |
oct | 35207156204423 |
9 | 7106687872573 |
10 | 2011013122323 |
11 | 705958531677 |
12 | 2858b8286103 |
13 | 11783a1047ba |
14 | 6d4953b8439 |
15 | 3749ecaee33 |
hex | 1d439b90913 |
2011013122323 has 4 divisors (see below), whose sum is σ = 2681350829768. Its totient is φ = 1340675414880.
The previous prime is 2011013122267. The next prime is 2011013122337. The reversal of 2011013122323 is 3232213101102.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 2011013122323 - 29 = 2011013121811 is a prime.
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 2011013122323.
It is not an unprimeable number, because it can be changed into a prime (2011013122373) 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 3 ways as a sum of consecutive naturals, for example, 335168853718 + ... + 335168853723.
It is an arithmetic number, because the mean of its divisors is an integer number (670337707442).
Almost surely, 22011013122323 is an apocalyptic number.
2011013122323 is a deficient number, since it is larger than the sum of its proper divisors (670337707445).
2011013122323 is an equidigital number, since it uses as much as digits as its factorization.
2011013122323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 670337707444.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 2011013122323 its reverse (3232213101102), we get a palindrome (5243226223425).
The spelling of 2011013122323 in words is "two trillion, eleven billion, thirteen million, one hundred twenty-two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •