Base | Representation |
---|---|
bin | 11101010010110111011… |
… | …110110011101100100011 |
3 | 21010110020000002101020201 |
4 | 131102313132303230203 |
5 | 230440333442013443 |
6 | 4140452124250031 |
7 | 265305031113403 |
oct | 35226736635443 |
9 | 7113200071221 |
10 | 2013123001123 |
11 | 7068404a7863 |
12 | 2861a69a0917 |
13 | 117ab5270cb0 |
14 | 6d6156b6803 |
15 | 3757512934d |
hex | 1d4b77b3b23 |
2013123001123 has 8 divisors (see below), whose sum is σ = 2220856144416. Its totient is φ = 1812943790400.
The previous prime is 2013123001081. The next prime is 2013123001133. The reversal of 2013123001123 is 3211003213102.
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 2013123001123 - 229 = 2012586130211 is a prime.
It is a super-2 number, since 2×20131230011232 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2013123001123.
It is not an unprimeable number, because it can be changed into a prime (2013123001133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1888482583 + ... + 1888483648.
It is an arithmetic number, because the mean of its divisors is an integer number (277607018052).
Almost surely, 22013123001123 is an apocalyptic number.
2013123001123 is a deficient number, since it is larger than the sum of its proper divisors (207733143293).
2013123001123 is a wasteful number, since it uses less digits than its factorization.
2013123001123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3776966285.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 2013123001123 its reverse (3211003213102), we get a palindrome (5224126214225).
The spelling of 2013123001123 in words is "two trillion, thirteen billion, one hundred twenty-three million, one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •