Base | Representation |
---|---|
bin | 111111000011111… |
… | …111100100000101 |
3 | 2201201211112210022 |
4 | 333003333210011 |
5 | 4131322331042 |
6 | 252552504525 |
7 | 35134643222 |
oct | 7703774405 |
9 | 2651745708 |
10 | 1058011397 |
11 | 4a3246693 |
12 | 2563ab145 |
13 | 13b26bc61 |
14 | a072c949 |
15 | 62d3ecd2 |
hex | 3f0ff905 |
1058011397 has 2 divisors, whose sum is σ = 1058011398. Its totient is φ = 1058011396.
The previous prime is 1058011363. The next prime is 1058011421. The reversal of 1058011397 is 7931108501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 880961761 + 177049636 = 29681^2 + 13306^2 .
It is an emirp because it is prime and its reverse (7931108501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1058011397 - 214 = 1057995013 is a prime.
It is a super-2 number, since 2×10580113972 = 2238776232363783218, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1058011327) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 529005698 + 529005699.
It is an arithmetic number, because the mean of its divisors is an integer number (529005699).
Almost surely, 21058011397 is an apocalyptic number.
It is an amenable number.
1058011397 is a deficient number, since it is larger than the sum of its proper divisors (1).
1058011397 is an equidigital number, since it uses as much as digits as its factorization.
1058011397 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7560, while the sum is 35.
The square root of 1058011397 is about 32527.0871275004. The cubic root of 1058011397 is about 1018.9748116055.
Adding to 1058011397 its reverse (7931108501), we get a palindrome (8989119898).
The spelling of 1058011397 in words is "one billion, fifty-eight million, eleven thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •