Base | Representation |
---|---|
bin | 11101000110101001011… |
… | …010001010010010000011 |
3 | 21002012100120121110110021 |
4 | 131012221122022102003 |
5 | 230232001003000003 |
6 | 4130442131514311 |
7 | 264331625335000 |
oct | 35065132122203 |
9 | 7065316543407 |
10 | 2000002000003 |
11 | 701217a97487 |
12 | 283744758997 |
13 | 1167a3ab47c7 |
14 | 6cb2cc508a7 |
15 | 370582752bd |
hex | 1d1a968a483 |
2000002000003 has 32 divisors (see below), whose sum is σ = 2413176768000. Its totient is φ = 1654908891552.
The previous prime is 2000002000001. The next prime is 2000002000063. The reversal of 2000002000003 is 3000002000002.
It is not a de Polignac number, because 2000002000003 - 21 = 2000002000001 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a self number, because there is not a number n which added to its sum of digits gives 2000002000003.
It is not an unprimeable number, because it can be changed into a prime (2000002000001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 84209376 + ... + 84233122.
It is an arithmetic number, because the mean of its divisors is an integer number (75411774000).
Almost surely, 22000002000003 is an apocalyptic number.
2000002000003 is a deficient number, since it is larger than the sum of its proper divisors (413174767997).
2000002000003 is an equidigital number, since it uses as much as digits as its factorization.
2000002000003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32264 (or 32250 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 7.
Adding to 2000002000003 its reverse (3000002000002), we get a palindrome (5000004000005).
Subtracting 2000002000003 from its reverse (3000002000002), we obtain a palindrome (999999999999).
The spelling of 2000002000003 in words is "two trillion, two million, three", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •