Base | Representation |
---|---|
bin | 11110110010110111010… |
… | …11001100011110101101 |
3 | 10202011010210211110202222 |
4 | 33121123223030132231 |
5 | 114313442100123111 |
6 | 2130030123125125 |
7 | 136305463434041 |
oct | 17313353143655 |
9 | 3664123743688 |
10 | 1058100004781 |
11 | 378812960476 |
12 | 1510976737a5 |
13 | 78a171c43b1 |
14 | 392d8834021 |
15 | 1c7cc2ac7db |
hex | f65bacc7ad |
1058100004781 has 2 divisors, whose sum is σ = 1058100004782. Its totient is φ = 1058100004780.
The previous prime is 1058100004751. The next prime is 1058100004783. The reversal of 1058100004781 is 1874000018501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1007080489156 + 51019515625 = 1003534^2 + 225875^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1058100004781 is a prime.
It is a super-2 number, since 2×10581000047812 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 1058100004783, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1058100004783) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 529050002390 + 529050002391.
It is an arithmetic number, because the mean of its divisors is an integer number (529050002391).
Almost surely, 21058100004781 is an apocalyptic number.
It is an amenable number.
1058100004781 is a deficient number, since it is larger than the sum of its proper divisors (1).
1058100004781 is an equidigital number, since it uses as much as digits as its factorization.
1058100004781 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8960, while the sum is 35.
The spelling of 1058100004781 in words is "one trillion, fifty-eight billion, one hundred million, four thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •