Base | Representation |
---|---|
bin | 100011100011110111001… |
… | …100010000110101010101 |
3 | 22122121120212020121201102 |
4 | 203203313030100311111 |
5 | 310014133241024112 |
6 | 5110340503435445 |
7 | 341356611321203 |
oct | 43436714206525 |
9 | 8577525217642 |
10 | 2443688611157 |
11 | 8623a95723a2 |
12 | 33572a455b85 |
13 | 1495921bbb01 |
14 | 863bd078073 |
15 | 43875124bc2 |
hex | 238f7310d55 |
2443688611157 has 2 divisors, whose sum is σ = 2443688611158. Its totient is φ = 2443688611156.
The previous prime is 2443688611103. The next prime is 2443688611261. The reversal of 2443688611157 is 7511168863442.
2443688611157 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., 2385993051556 + 57695559601 = 1544666^2 + 240199^2 .
It is a cyclic number.
It is not a de Polignac number, because 2443688611157 - 28 = 2443688610901 is a prime.
It is a super-2 number, since 2×24436886111572 (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 (2443688610157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1221844305578 + 1221844305579.
It is an arithmetic number, because the mean of its divisors is an integer number (1221844305579).
Almost surely, 22443688611157 is an apocalyptic number.
It is an amenable number.
2443688611157 is a deficient number, since it is larger than the sum of its proper divisors (1).
2443688611157 is an equidigital number, since it uses as much as digits as its factorization.
2443688611157 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 7741440, while the sum is 56.
The spelling of 2443688611157 in words is "two trillion, four hundred forty-three billion, six hundred eighty-eight million, six hundred eleven thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •