Base | Representation |
---|---|
bin | 11101110001110110110… |
… | …00011010101010001111 |
3 | 10121211001110102221122002 |
4 | 32320323120122222033 |
5 | 113231002302112342 |
6 | 2102014554142515 |
7 | 133631545342445 |
oct | 16707330325217 |
9 | 3554043387562 |
10 | 1023198472847 |
11 | 364a32954a01 |
12 | 146377121a3b |
13 | 756444c8b55 |
14 | 3774743ab95 |
15 | 1b9381ccd32 |
hex | ee3b61aa8f |
1023198472847 has 2 divisors, whose sum is σ = 1023198472848. Its totient is φ = 1023198472846.
The previous prime is 1023198472789. The next prime is 1023198472859. The reversal of 1023198472847 is 7482748913201.
It is a strong prime.
It is an emirp because it is prime and its reverse (7482748913201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1023198472847 - 218 = 1023198210703 is a prime.
It is a super-2 number, since 2×10231984728472 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1023198472792 and 1023198472801.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1023198471847) 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, 511599236423 + 511599236424.
It is an arithmetic number, because the mean of its divisors is an integer number (511599236424).
Almost surely, 21023198472847 is an apocalyptic number.
1023198472847 is a deficient number, since it is larger than the sum of its proper divisors (1).
1023198472847 is an equidigital number, since it uses as much as digits as its factorization.
1023198472847 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5419008, while the sum is 56.
The spelling of 1023198472847 in words is "one trillion, twenty-three billion, one hundred ninety-eight million, four hundred seventy-two thousand, eight hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •