Base | Representation |
---|---|
bin | 111111000101011… |
… | …101010001101101 |
3 | 2201202120001022220 |
4 | 333011131101231 |
5 | 4131422121440 |
6 | 253005025553 |
7 | 35141132265 |
oct | 7705352155 |
9 | 2652501286 |
10 | 1058395245 |
11 | 4a3489016 |
12 | 2565552b9 |
13 | 13b37489b |
14 | a07cc7a5 |
15 | 62db88d0 |
hex | 3f15d46d |
1058395245 has 32 divisors (see below), whose sum is σ = 1720134144. Its totient is φ = 555609600.
The previous prime is 1058395237. The next prime is 1058395253. The reversal of 1058395245 is 5425938501.
It is an interprime number because it is at equal distance from previous prime (1058395237) and next prime (1058395253).
It is not a de Polignac number, because 1058395245 - 23 = 1058395237 is a prime.
It is a super-2 number, since 2×10583952452 = 2240400989277220050, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1058395197 and 1058395206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 997015 + ... + 998075.
It is an arithmetic number, because the mean of its divisors is an integer number (53754192).
Almost surely, 21058395245 is an apocalyptic number.
1058395245 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1058395245 is a deficient number, since it is larger than the sum of its proper divisors (661738899).
1058395245 is a wasteful number, since it uses less digits than its factorization.
1058395245 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2053.
The product of its (nonzero) digits is 216000, while the sum is 42.
The square root of 1058395245 is about 32532.9870285530. The cubic root of 1058395245 is about 1019.0980251969.
The spelling of 1058395245 in words is "one billion, fifty-eight million, three hundred ninety-five thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •