Base | Representation |
---|---|
bin | 11101001010011011010… |
… | …10001111111101001010 |
3 | 10112210102012210101212110 |
4 | 32211031222033331022 |
5 | 112404124224113002 |
6 | 2044154254523150 |
7 | 132252150011643 |
oct | 16451552177512 |
9 | 3483365711773 |
10 | 1002030301002 |
11 | 356a5aa89105 |
12 | 142249b064b6 |
13 | 7364cac1b93 |
14 | 366d9d4c6ca |
15 | 1b0e9b11e6c |
hex | e94da8ff4a |
1002030301002 has 8 divisors (see below), whose sum is σ = 2004060602016. Its totient is φ = 334010100332.
The previous prime is 1002030300983. The next prime is 1002030301009. The reversal of 1002030301002 is 2001030302001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
1002030301002 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (1002030301009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 83502525078 + ... + 83502525089.
It is an arithmetic number, because the mean of its divisors is an integer number (250507575252).
Almost surely, 21002030301002 is an apocalyptic number.
1002030301002 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1002030301002 is a wasteful number, since it uses less digits than its factorization.
1002030301002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167005050172.
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 1002030301002 its reverse (2001030302001), we get a palindrome (3003060603003).
Subtracting 1002030301002 from its reverse (2001030302001), we obtain a palindrome (999000000999).
The spelling of 1002030301002 in words is "one trillion, two billion, thirty million, three hundred one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •