Base | Representation |
---|---|
bin | 111010010011010011000… |
… | …011011010010010000101 |
3 | 112012000100102021022012211 |
4 | 322103103003122102011 |
5 | 1011120202301002113 |
6 | 12304312104343421 |
7 | 562312401363061 |
oct | 72232303322205 |
9 | 15160312238184 |
10 | 4006450406533 |
11 | 1305142896563 |
12 | 548588174b71 |
13 | 230a642a4233 |
14 | dbcadcb4aa1 |
15 | 6e33c411b3d |
hex | 3a4d30da485 |
4006450406533 has 2 divisors, whose sum is σ = 4006450406534. Its totient is φ = 4006450406532.
The previous prime is 4006450406509. The next prime is 4006450406557. The reversal of 4006450406533 is 3356040546004.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (4006450406509) and next prime (4006450406557).
It can be written as a sum of positive squares in only one way, i.e., 3830937169284 + 175513237249 = 1957278^2 + 418943^2 .
It is a cyclic number.
It is not a de Polignac number, because 4006450406533 - 237 = 3869011453061 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4006450476533) 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, 2003225203266 + 2003225203267.
It is an arithmetic number, because the mean of its divisors is an integer number (2003225203267).
Almost surely, 24006450406533 is an apocalyptic number.
It is an amenable number.
4006450406533 is a deficient number, since it is larger than the sum of its proper divisors (1).
4006450406533 is an equidigital number, since it uses as much as digits as its factorization.
4006450406533 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 518400, while the sum is 40.
The spelling of 4006450406533 in words is "four trillion, six billion, four hundred fifty million, four hundred six thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •