Base | Representation |
---|---|
bin | 11101001100001111001… |
… | …01011101001100000101 |
3 | 10112212220221110002001021 |
4 | 32212013211131030011 |
5 | 112413122020414023 |
6 | 2044434532231141 |
7 | 132315220243162 |
oct | 16460745351405 |
9 | 3485827402037 |
10 | 1003002123013 |
11 | 3574096063a0 |
12 | 14247b46b4b1 |
13 | 737762444a7 |
14 | 3678d043069 |
15 | 1b1550c935d |
hex | e98795d305 |
1003002123013 has 8 divisors (see below), whose sum is σ = 1098078031296. Its totient is φ = 908575197600.
The previous prime is 1003002123001. The next prime is 1003002123023. The reversal of 1003002123013 is 3103212003001.
1003002123013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1003002123013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1003002123023) 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, 162242481 + ... + 162248662.
It is an arithmetic number, because the mean of its divisors is an integer number (137259753912).
Almost surely, 21003002123013 is an apocalyptic number.
It is an amenable number.
1003002123013 is a deficient number, since it is larger than the sum of its proper divisors (95075908283).
1003002123013 is a wasteful number, since it uses less digits than its factorization.
1003002123013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 324491435.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 1003002123013 its reverse (3103212003001), we get a palindrome (4106214126014).
The spelling of 1003002123013 in words is "one trillion, three billion, two million, one hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •