Base | Representation |
---|---|
bin | 11100000111100001110… |
… | …011000001010010111101 |
3 | 20211201102022221012101201 |
4 | 130013201303001102331 |
5 | 223124201003023112 |
6 | 4035353055535501 |
7 | 256412265543013 |
oct | 34074163012275 |
9 | 6751368835351 |
10 | 1932228564157 |
11 | 6854a9718a81 |
12 | 27258b52a591 |
13 | 110292a3c948 |
14 | 6973dc2c8b3 |
15 | 353dd37c257 |
hex | 1c1e1cc14bd |
1932228564157 has 2 divisors, whose sum is σ = 1932228564158. Its totient is φ = 1932228564156.
The previous prime is 1932228564127. The next prime is 1932228564197. The reversal of 1932228564157 is 7514658222391.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1928290499641 + 3938064516 = 1388629^2 + 62754^2 .
It is an emirp because it is prime and its reverse (7514658222391) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1932228564157 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1932228564098 and 1932228564107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1932228564127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 966114282078 + 966114282079.
It is an arithmetic number, because the mean of its divisors is an integer number (966114282079).
Almost surely, 21932228564157 is an apocalyptic number.
It is an amenable number.
1932228564157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1932228564157 is an equidigital number, since it uses as much as digits as its factorization.
1932228564157 is an evil number, because the sum of its binary digits is even.
The product of its digits is 7257600, while the sum is 55.
The spelling of 1932228564157 in words is "one trillion, nine hundred thirty-two billion, two hundred twenty-eight million, five hundred sixty-four thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •