Base | Representation |
---|---|
bin | 100000011111101000011… |
… | …011001011011111100101 |
3 | 21220110201201212102100102 |
4 | 200133220123023133211 |
5 | 243041124242400301 |
6 | 4425453102553445 |
7 | 320220340200326 |
oct | 40375033133745 |
9 | 7813651772312 |
10 | 2232987465701 |
11 | 791006235233 |
12 | 300926b98885 |
13 | 132753b61905 |
14 | 7a111a7c44d |
15 | 3d142495b6b |
hex | 207e86cb7e5 |
2232987465701 has 2 divisors, whose sum is σ = 2232987465702. Its totient is φ = 2232987465700.
The previous prime is 2232987465697. The next prime is 2232987465713. The reversal of 2232987465701 is 1075647892322.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2080520644801 + 152466820900 = 1442401^2 + 390470^2 .
It is a cyclic number.
It is not a de Polignac number, because 2232987465701 - 22 = 2232987465697 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2232987465001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1116493732850 + 1116493732851.
It is an arithmetic number, because the mean of its divisors is an integer number (1116493732851).
It is a 1-persistent number, because it is pandigital, but 2⋅2232987465701 = 4465974931402 is not.
Almost surely, 22232987465701 is an apocalyptic number.
It is an amenable number.
2232987465701 is a deficient number, since it is larger than the sum of its proper divisors (1).
2232987465701 is an equidigital number, since it uses as much as digits as its factorization.
2232987465701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10160640, while the sum is 56.
The spelling of 2232987465701 in words is "two trillion, two hundred thirty-two billion, nine hundred eighty-seven million, four hundred sixty-five thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •