Base | Representation |
---|---|
bin | 11110110100101110000… |
… | …10110001100110111001 |
3 | 10202020201020001101212010 |
4 | 33122113002301212321 |
5 | 114323012041320123 |
6 | 2130313023440133 |
7 | 136342246551300 |
oct | 17322702614671 |
9 | 3666636041763 |
10 | 1059096041913 |
11 | 379184117958 |
12 | 151315156049 |
13 | 78b45674890 |
14 | 39390c2d437 |
15 | 1c839959993 |
hex | f6970b19b9 |
1059096041913 has 96 divisors (see below), whose sum is σ = 1820641315584. Its totient is φ = 542411831808.
The previous prime is 1059096041897. The next prime is 1059096041929. The reversal of 1059096041913 is 3191406909501.
It is an interprime number because it is at equal distance from previous prime (1059096041897) and next prime (1059096041929).
It is not a de Polignac number, because 1059096041913 - 24 = 1059096041897 is a prime.
It is a super-2 number, since 2×10590960419132 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1059096021913) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 34418931 + ... + 34449687.
It is an arithmetic number, because the mean of its divisors is an integer number (18965013704).
Almost surely, 21059096041913 is an apocalyptic number.
1059096041913 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1059096041913 is a deficient number, since it is larger than the sum of its proper divisors (761545273671).
1059096041913 is a wasteful number, since it uses less digits than its factorization.
1059096041913 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31311 (or 31304 counting only the distinct ones).
The product of its (nonzero) digits is 262440, while the sum is 48.
The spelling of 1059096041913 in words is "one trillion, fifty-nine billion, ninety-six million, forty-one thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.229 sec. • engine limits •