Base | Representation |
---|---|
bin | 11110110010111000000… |
… | …00011000110100111101 |
3 | 10202011011012021201121221 |
4 | 33121130000120310331 |
5 | 114314000010413011 |
6 | 2130030442153341 |
7 | 136305561603112 |
oct | 17313400306475 |
9 | 3664135251557 |
10 | 1058105560381 |
11 | 378816005481 |
12 | 1510994b2851 |
13 | 78a183bb02c |
14 | 392d947c909 |
15 | 1c7cca08971 |
hex | f65c018d3d |
1058105560381 has 2 divisors, whose sum is σ = 1058105560382. Its totient is φ = 1058105560380.
The previous prime is 1058105560297. The next prime is 1058105560399. The reversal of 1058105560381 is 1830655018501.
1058105560381 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 727423057881 + 330682502500 = 852891^2 + 575050^2 .
It is a cyclic number.
It is not a de Polignac number, because 1058105560381 - 223 = 1058097171773 is a prime.
It is a super-2 number, since 2×10581055603812 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1058105540381) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 529052780190 + 529052780191.
It is an arithmetic number, because the mean of its divisors is an integer number (529052780191).
Almost surely, 21058105560381 is an apocalyptic number.
It is an amenable number.
1058105560381 is a deficient number, since it is larger than the sum of its proper divisors (1).
1058105560381 is an equidigital number, since it uses as much as digits as its factorization.
1058105560381 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144000, while the sum is 43.
The spelling of 1058105560381 in words is "one trillion, fifty-eight billion, one hundred five million, five hundred sixty thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •