Base | Representation |
---|---|
bin | 11101001010011000111… |
… | …00111001000001101001 |
3 | 10112210100210122010022001 |
4 | 32211030130321001221 |
5 | 112404104031200433 |
6 | 2044152252131001 |
7 | 132251512441321 |
oct | 16451434710151 |
9 | 3483323563261 |
10 | 1002010021993 |
11 | 356a4a5981a2 |
12 | 142243166a61 |
13 | 73648841776 |
14 | 366d7390281 |
15 | 1b0e7e5857d |
hex | e94c739069 |
1002010021993 has 4 divisors (see below), whose sum is σ = 1025312580688. Its totient is φ = 978707463300.
The previous prime is 1002010021927. The next prime is 1002010022003. The reversal of 1002010021993 is 3991200102001.
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 a de Polignac number, because none of the positive numbers 2k-1002010021993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1002010021913) 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 3 ways as a sum of consecutive naturals, for example, 11651279283 + ... + 11651279368.
It is an arithmetic number, because the mean of its divisors is an integer number (256328145172).
Almost surely, 21002010021993 is an apocalyptic number.
It is an amenable number.
1002010021993 is a deficient number, since it is larger than the sum of its proper divisors (23302558695).
1002010021993 is an equidigital number, since it uses as much as digits as its factorization.
1002010021993 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23302558694.
The product of its (nonzero) digits is 972, while the sum is 28.
Adding to 1002010021993 its reverse (3991200102001), we get a palindrome (4993210123994).
The spelling of 1002010021993 in words is "one trillion, two billion, ten million, twenty-one thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •