Base | Representation |
---|---|
bin | 100000011100111110110… |
… | …010000100100100110101 |
3 | 21220012101101101020210211 |
4 | 200130332302010210311 |
5 | 243014312140334312 |
6 | 4424302432345421 |
7 | 320056660421536 |
oct | 40347662044465 |
9 | 7805341336724 |
10 | 2230141339957 |
11 | 78a8857128a3 |
12 | 3002719a5271 |
13 | 1323bc30483b |
14 | 79d21a8c68d |
15 | 3d0276993a7 |
hex | 2073ec84935 |
2230141339957 has 2 divisors, whose sum is σ = 2230141339958. Its totient is φ = 2230141339956.
The previous prime is 2230141339931. The next prime is 2230141340003. The reversal of 2230141339957 is 7599331410322.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2130458432881 + 99682907076 = 1459609^2 + 315726^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2230141339957 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2230141339957.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2230141339927) 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, 1115070669978 + 1115070669979.
It is an arithmetic number, because the mean of its divisors is an integer number (1115070669979).
Almost surely, 22230141339957 is an apocalyptic number.
It is an amenable number.
2230141339957 is a deficient number, since it is larger than the sum of its proper divisors (1).
2230141339957 is an equidigital number, since it uses as much as digits as its factorization.
2230141339957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1224720, while the sum is 49.
The spelling of 2230141339957 in words is "two trillion, two hundred thirty billion, one hundred forty-one million, three hundred thirty-nine thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •