Base | Representation |
---|---|
bin | 11101001010101111111… |
… | …01001010100111001101 |
3 | 10112210212020211001021022 |
4 | 32211113331022213031 |
5 | 112410002434011023 |
6 | 2044223345043525 |
7 | 132256345133621 |
oct | 16452775124715 |
9 | 3483766731238 |
10 | 1002203032013 |
11 | 357039536507 |
12 | 1422979265a5 |
13 | 7367981c291 |
14 | 36714c73181 |
15 | 1b109d817c8 |
hex | e957f4a9cd |
1002203032013 has 4 divisors (see below), whose sum is σ = 1002205270368. Its totient is φ = 1002200793660.
The previous prime is 1002203032007. The next prime is 1002203032069. The reversal of 1002203032013 is 3102303022001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1002203032013 - 220 = 1002201983437 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1002203031982 and 1002203032000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1002203092013) 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, 190943 + ... + 1428588.
It is an arithmetic number, because the mean of its divisors is an integer number (250551317592).
Almost surely, 21002203032013 is an apocalyptic number.
It is an amenable number.
1002203032013 is a deficient number, since it is larger than the sum of its proper divisors (2238355).
1002203032013 is an equidigital number, since it uses as much as digits as its factorization.
1002203032013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2238354.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 1002203032013 its reverse (3102303022001), we get a palindrome (4104506054014).
The spelling of 1002203032013 in words is "one trillion, two billion, two hundred three million, thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •