Base | Representation |
---|---|
bin | 11101001010011000000… |
… | …01011110011000110101 |
3 | 10112210100022002222121000 |
4 | 32211030001132120311 |
5 | 112404100211204442 |
6 | 2044151434113513 |
7 | 132251364366063 |
oct | 16451401363065 |
9 | 3483308088530 |
10 | 1002002834997 |
11 | 356a4652952a |
12 | 14224087b899 |
13 | 736471c63c8 |
14 | 366d643d033 |
15 | 1b0e74d8d4c |
hex | e94c05e635 |
1002002834997 has 16 divisors (see below), whose sum is σ = 1488853550080. Its totient is φ = 666019682496.
The previous prime is 1002002834969. The next prime is 1002002834999. The reversal of 1002002834997 is 7994382002001.
1002002834997 is a `hidden beast` number, since 10 + 0 + 200 + 2 + 8 + 349 + 97 = 666.
It is not a de Polignac number, because 1002002834997 - 28 = 1002002834741 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 (1002002834999) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 55052053 + ... + 55070250.
It is an arithmetic number, because the mean of its divisors is an integer number (93053346880).
Almost surely, 21002002834997 is an apocalyptic number.
It is an amenable number.
1002002834997 is a deficient number, since it is larger than the sum of its proper divisors (486850715083).
1002002834997 is a wasteful number, since it uses less digits than its factorization.
1002002834997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110122649 (or 110122643 counting only the distinct ones).
The product of its (nonzero) digits is 217728, while the sum is 45.
Adding to 1002002834997 its reverse (7994382002001), we get a palindrome (8996384836998).
The spelling of 1002002834997 in words is "one trillion, two billion, two million, eight hundred thirty-four thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •