Base | Representation |
---|---|
bin | 11111010001111100001… |
… | …00001101001110000001 |
3 | 10210202012111001020102012 |
4 | 33220332010031032001 |
5 | 120102123434122423 |
6 | 2141425404102305 |
7 | 140436061506542 |
oct | 17507604151601 |
9 | 3722174036365 |
10 | 1074783114113 |
11 | 3848a4059435 |
12 | 154372834995 |
13 | 7a475654917 |
14 | 3a03c3c44c9 |
15 | 1ce56c3b078 |
hex | fa3e10d381 |
1074783114113 has 2 divisors, whose sum is σ = 1074783114114. Its totient is φ = 1074783114112.
The previous prime is 1074783114047. The next prime is 1074783114127. The reversal of 1074783114113 is 3114113874701.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 887633432449 + 187149681664 = 942143^2 + 432608^2 .
It is an emirp because it is prime and its reverse (3114113874701) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1074783114113 - 212 = 1074783110017 is a prime.
It is not a weakly prime, because it can be changed into another prime (1074783114913) 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, 537391557056 + 537391557057.
It is an arithmetic number, because the mean of its divisors is an integer number (537391557057).
Almost surely, 21074783114113 is an apocalyptic number.
It is an amenable number.
1074783114113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1074783114113 is an equidigital number, since it uses as much as digits as its factorization.
1074783114113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56448, while the sum is 41.
Adding to 1074783114113 its reverse (3114113874701), we get a palindrome (4188896988814).
The spelling of 1074783114113 in words is "one trillion, seventy-four billion, seven hundred eighty-three million, one hundred fourteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.034 sec. • engine limits •