Base | Representation |
---|---|
bin | 11110110010111011101… |
… | …10001000001001001101 |
3 | 10202011020100100210222100 |
4 | 33121131312020021031 |
5 | 114314030411100122 |
6 | 2130033503505313 |
7 | 136306415132406 |
oct | 17313566101115 |
9 | 3664210323870 |
10 | 1058136425037 |
11 | 37883147655a |
12 | 1510a78b8239 |
13 | 78a21906743 |
14 | 392dd5d49ad |
15 | 1c7d05a3aac |
hex | f65dd8824d |
1058136425037 has 12 divisors (see below), whose sum is σ = 1528445977344. Its totient is φ = 705411961800.
The previous prime is 1058136424987. The next prime is 1058136425051. The reversal of 1058136425037 is 7305246318501.
It is a happy number.
1058136425037 is a `hidden beast` number, since 1 + 0 + 5 + 8 + 1 + 364 + 250 + 37 = 666.
It is not a de Polignac number, because 1058136425037 - 219 = 1058135900749 is a prime.
It is a super-2 number, since 2×10581364250372 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1058136424983 and 1058136425001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1058136425537) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 466839 + ... + 1527812.
It is an arithmetic number, because the mean of its divisors is an integer number (127370498112).
Almost surely, 21058136425037 is an apocalyptic number.
It is an amenable number.
1058136425037 is a deficient number, since it is larger than the sum of its proper divisors (470309552307).
1058136425037 is a wasteful number, since it uses less digits than its factorization.
1058136425037 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2053600 (or 2053597 counting only the distinct ones).
The product of its (nonzero) digits is 604800, while the sum is 45.
The spelling of 1058136425037 in words is "one trillion, fifty-eight billion, one hundred thirty-six million, four hundred twenty-five thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •