Base | Representation |
---|---|
bin | 11101001000101000111… |
… | …001110100111000100001 |
3 | 21002101212122112021222012 |
4 | 131020220321310320201 |
5 | 230300341044214033 |
6 | 4131434302122305 |
7 | 264435630524102 |
oct | 35105071647041 |
9 | 7071778467865 |
10 | 2002141007393 |
11 | 70211544838a |
12 | 284040b80395 |
13 | 116a54cac457 |
14 | 6cc92d723a9 |
15 | 37130e45248 |
hex | 1d228e74e21 |
2002141007393 has 2 divisors, whose sum is σ = 2002141007394. Its totient is φ = 2002141007392.
The previous prime is 2002141007389. The next prime is 2002141007431. The reversal of 2002141007393 is 3937001412002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1936416968704 + 65724038689 = 1391552^2 + 256367^2 .
It is a cyclic number.
It is not a de Polignac number, because 2002141007393 - 22 = 2002141007389 is a prime.
It is a super-2 number, since 2×20021410073932 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2002141007303) 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 as a sum of consecutive naturals, namely, 1001070503696 + 1001070503697.
It is an arithmetic number, because the mean of its divisors is an integer number (1001070503697).
Almost surely, 22002141007393 is an apocalyptic number.
It is an amenable number.
2002141007393 is a deficient number, since it is larger than the sum of its proper divisors (1).
2002141007393 is an equidigital number, since it uses as much as digits as its factorization.
2002141007393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9072, while the sum is 32.
Adding to 2002141007393 its reverse (3937001412002), we get a palindrome (5939142419395).
The spelling of 2002141007393 in words is "two trillion, two billion, one hundred forty-one million, seven thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •