Base | Representation |
---|---|
bin | 11101001011001001110… |
… | …01000010010101010111 |
3 | 10112211102101011212120001 |
4 | 32211210321002111113 |
5 | 112410424013201320 |
6 | 2044301100352131 |
7 | 132264621603061 |
oct | 16454471022527 |
9 | 3484371155501 |
10 | 1002420053335 |
11 | 35713aa94878 |
12 | 142338545647 |
13 | 736b2785c6c |
14 | 36735a06731 |
15 | 1b11de4e20a |
hex | e964e42557 |
1002420053335 has 4 divisors (see below), whose sum is σ = 1202904064008. Its totient is φ = 801936042664.
The previous prime is 1002420053333. The next prime is 1002420053387. The reversal of 1002420053335 is 5333500242001.
1002420053335 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1002420053335 - 21 = 1002420053333 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 (1002420053333) 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, 100242005329 + ... + 100242005338.
It is an arithmetic number, because the mean of its divisors is an integer number (300726016002).
Almost surely, 21002420053335 is an apocalyptic number.
1002420053335 is a deficient number, since it is larger than the sum of its proper divisors (200484010673).
1002420053335 is an equidigital number, since it uses as much as digits as its factorization.
1002420053335 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 200484010672.
The product of its (nonzero) digits is 10800, while the sum is 28.
Adding to 1002420053335 its reverse (5333500242001), we get a palindrome (6335920295336).
The spelling of 1002420053335 in words is "one trillion, two billion, four hundred twenty million, fifty-three thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •