Base | Representation |
---|---|
bin | 101101101101011010101010… |
… | …1001110001100101001110101 |
3 | 1221201121011011000020022120212 |
4 | 1123122311111032030221311 |
5 | 410144423041014000103 |
6 | 3543042355221435205 |
7 | 150455216221621613 |
oct | 13332652516145165 |
9 | 1851534130208525 |
10 | 402066203265653 |
11 | 107124356998873 |
12 | 39117159b6bb05 |
13 | 143468ac7668a4 |
14 | 714017278c6b3 |
15 | 31739e82487d8 |
hex | 16dad5538ca75 |
402066203265653 has 2 divisors, whose sum is σ = 402066203265654. Its totient is φ = 402066203265652.
The previous prime is 402066203265563. The next prime is 402066203265659. The reversal of 402066203265653 is 356562302660204.
Together with previous prime (402066203265563) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 373472553891844 + 28593649373809 = 19325438^2 + 5347303^2 .
It is a cyclic number.
It is not a de Polignac number, because 402066203265653 - 222 = 402066199071349 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (402066203265659) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 201033101632826 + 201033101632827.
It is an arithmetic number, because the mean of its divisors is an integer number (201033101632827).
Almost surely, 2402066203265653 is an apocalyptic number.
It is an amenable number.
402066203265653 is a deficient number, since it is larger than the sum of its proper divisors (1).
402066203265653 is an equidigital number, since it uses as much as digits as its factorization.
402066203265653 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9331200, while the sum is 50.
The spelling of 402066203265653 in words is "four hundred two trillion, sixty-six billion, two hundred three million, two hundred sixty-five thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •