Base | Representation |
---|---|
bin | 110101000000011101100001… |
… | …1100111100010010000101001 |
3 | 2021010212200010010012202002201 |
4 | 1222000323003213202100221 |
5 | 442103120441424441413 |
6 | 4331351112323300201 |
7 | 200131623541366114 |
oct | 15200730347422051 |
9 | 2233780103182081 |
10 | 466256341640233 |
11 | 12562222763a591 |
12 | 4436372951a661 |
13 | 17021a27300a51 |
14 | 831ccda8c357b |
15 | 38d85e65a29dd |
hex | 1a80ec39e2429 |
466256341640233 has 2 divisors, whose sum is σ = 466256341640234. Its totient is φ = 466256341640232.
The previous prime is 466256341640227. The next prime is 466256341640261. The reversal of 466256341640233 is 332046143652664.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 259528652471449 + 206727689168784 = 16109893^2 + 14378028^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-466256341640233 is a prime.
It is a super-2 number, since 2×4662563416402332 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (466256341640533) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 233128170820116 + 233128170820117.
It is an arithmetic number, because the mean of its divisors is an integer number (233128170820117).
Almost surely, 2466256341640233 is an apocalyptic number.
It is an amenable number.
466256341640233 is a deficient number, since it is larger than the sum of its proper divisors (1).
466256341640233 is an equidigital number, since it uses as much as digits as its factorization.
466256341640233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 44789760, while the sum is 55.
The spelling of 466256341640233 in words is "four hundred sixty-six trillion, two hundred fifty-six billion, three hundred forty-one million, six hundred forty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •