Base | Representation |
---|---|
bin | 11101001010101010000… |
… | …11011110001010100001 |
3 | 10112210201212012220122111 |
4 | 32211111003132022201 |
5 | 112404403003301223 |
6 | 2044214445435321 |
7 | 132255214311331 |
oct | 16452503361241 |
9 | 3483655186574 |
10 | 1002154353313 |
11 | 357014008483 |
12 | 14228356bb41 |
13 | 7366c707409 |
14 | 3670c6010c1 |
15 | 1b10596830d |
hex | e9550de2a1 |
1002154353313 has 2 divisors, whose sum is σ = 1002154353314. Its totient is φ = 1002154353312.
The previous prime is 1002154353301. The next prime is 1002154353353. The reversal of 1002154353313 is 3133534512001.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 990835095649 + 11319257664 = 995407^2 + 106392^2 .
It is a cyclic number.
It is not a de Polignac number, because 1002154353313 - 217 = 1002154222241 is a prime.
It is not a weakly prime, because it can be changed into another prime (1002154353353) 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, 501077176656 + 501077176657.
It is an arithmetic number, because the mean of its divisors is an integer number (501077176657).
Almost surely, 21002154353313 is an apocalyptic number.
It is an amenable number.
1002154353313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1002154353313 is an equidigital number, since it uses as much as digits as its factorization.
1002154353313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16200, while the sum is 31.
Adding to 1002154353313 its reverse (3133534512001), we get a palindrome (4135688865314).
The spelling of 1002154353313 in words is "one trillion, two billion, one hundred fifty-four million, three hundred fifty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •