Base | Representation |
---|---|
bin | 111011111001111… |
… | …1110001111111111 |
3 | 12012002101022200111 |
4 | 1313303332033333 |
5 | 13104042104043 |
6 | 531243410451 |
7 | 100545451552 |
oct | 16763761777 |
9 | 5162338614 |
10 | 2010113023 |
11 | 941724736 |
12 | 481223a27 |
13 | 2605a84b9 |
14 | 150d6c699 |
15 | bb70e09d |
hex | 77cfe3ff |
2010113023 has 4 divisors (see below), whose sum is σ = 2064440440. Its totient is φ = 1955785608.
The previous prime is 2010112981. The next prime is 2010113041. The reversal of 2010113023 is 3203110102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2010113023 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2010112994 and 2010113012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2010113323) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 27163653 + ... + 27163726.
It is an arithmetic number, because the mean of its divisors is an integer number (516110110).
Almost surely, 22010113023 is an apocalyptic number.
2010113023 is a deficient number, since it is larger than the sum of its proper divisors (54327417).
2010113023 is an equidigital number, since it uses as much as digits as its factorization.
2010113023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54327416.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 2010113023 is about 44834.2840134645. The cubic root of 2010113023 is about 1262.0410823365.
Adding to 2010113023 its reverse (3203110102), we get a palindrome (5213223125).
It can be divided in two parts, 20101 and 13023, that added together give a square (33124 = 1822).
The spelling of 2010113023 in words is "two billion, ten million, one hundred thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •