Base | Representation |
---|---|
bin | 100001101011100010000… |
… | …111111111011000000101 |
3 | 22012021002112000120121202 |
4 | 201223202013333120011 |
5 | 300410031423310121 |
6 | 4531132114352245 |
7 | 326134060451666 |
oct | 41534207773005 |
9 | 8167075016552 |
10 | 2314486150661 |
11 | 812628103523 |
12 | 31469088b685 |
13 | 13a341618259 |
14 | 8004389736d |
15 | 403122ee40b |
hex | 21ae21ff605 |
2314486150661 has 2 divisors, whose sum is σ = 2314486150662. Its totient is φ = 2314486150660.
The previous prime is 2314486150649. The next prime is 2314486150709. The reversal of 2314486150661 is 1660516844132.
2314486150661 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2167022470561 + 147463680100 = 1472081^2 + 384010^2 .
It is a cyclic number.
It is not a de Polignac number, because 2314486150661 - 26 = 2314486150597 is a prime.
It is a super-2 number, since 2×23144861506612 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2314486150961) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1157243075330 + 1157243075331.
It is an arithmetic number, because the mean of its divisors is an integer number (1157243075331).
Almost surely, 22314486150661 is an apocalyptic number.
It is an amenable number.
2314486150661 is a deficient number, since it is larger than the sum of its proper divisors (1).
2314486150661 is an equidigital number, since it uses as much as digits as its factorization.
2314486150661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 829440, while the sum is 47.
The spelling of 2314486150661 in words is "two trillion, three hundred fourteen billion, four hundred eighty-six million, one hundred fifty thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •