Base | Representation |
---|---|
bin | 111011101011010… |
… | …0011111011001111 |
3 | 12011112212121112221 |
4 | 1313112203323033 |
5 | 13100103344043 |
6 | 530410240211 |
7 | 100423100455 |
oct | 16726437317 |
9 | 5145777487 |
10 | 2002403023 |
11 | 938339035 |
12 | 47a726067 |
13 | 25bb0907a |
14 | 14dd229d5 |
15 | babd98ed |
hex | 775a3ecf |
2002403023 has 4 divisors (see below), whose sum is σ = 2089464048. Its totient is φ = 1915342000.
The previous prime is 2002403009. The next prime is 2002403033. The reversal of 2002403023 is 3203042002.
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 2002403023 - 213 = 2002394831 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2002402988 and 2002403006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002403033) 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, 43530478 + ... + 43530523.
It is an arithmetic number, because the mean of its divisors is an integer number (522366012).
Almost surely, 22002403023 is an apocalyptic number.
2002403023 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
2002403023 is a deficient number, since it is larger than the sum of its proper divisors (87061025).
2002403023 is an equidigital number, since it uses as much as digits as its factorization.
2002403023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87061024.
The product of its (nonzero) digits is 288, while the sum is 16.
The square root of 2002403023 is about 44748.2180986014. The cubic root of 2002403023 is about 1260.4254511443.
Adding to 2002403023 its reverse (3203042002), we get a palindrome (5205445025).
The spelling of 2002403023 in words is "two billion, two million, four hundred three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •