Base | Representation |
---|---|
bin | 111100000000010… |
… | …0101101010111111 |
3 | 12012022121100022101 |
4 | 1320000211222333 |
5 | 13110413421343 |
6 | 531442325531 |
7 | 100615534543 |
oct | 17000455277 |
9 | 5168540271 |
10 | 2013420223 |
11 | 943583461 |
12 | 4823598a7 |
13 | 261195919 |
14 | 15158da23 |
15 | bbb63e4d |
hex | 78025abf |
2013420223 has 4 divisors (see below), whose sum is σ = 2013639160. Its totient is φ = 2013201288.
The previous prime is 2013420221. The next prime is 2013420247. The reversal of 2013420223 is 3220243102.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3220243102 = 2 ⋅1610121551.
It is a cyclic number.
It is not a de Polignac number, because 2013420223 - 21 = 2013420221 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 2013420223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2013420221) 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, 95040 + ... + 114277.
It is an arithmetic number, because the mean of its divisors is an integer number (503409790).
Almost surely, 22013420223 is an apocalyptic number.
2013420223 is a deficient number, since it is larger than the sum of its proper divisors (218937).
2013420223 is an equidigital number, since it uses as much as digits as its factorization.
2013420223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 218936.
The product of its (nonzero) digits is 576, while the sum is 19.
The square root of 2013420223 is about 44871.1513447114. The cubic root of 2013420223 is about 1262.7328403410.
Adding to 2013420223 its reverse (3220243102), we get a palindrome (5233663325).
The spelling of 2013420223 in words is "two billion, thirteen million, four hundred twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •