Base | Representation |
---|---|
bin | 11110110000110110100… |
… | …10111010010000100001 |
3 | 10202001100112102022021002 |
4 | 33120123102322100201 |
5 | 114304234043144430 |
6 | 2125331020441345 |
7 | 136236636610262 |
oct | 17303322722041 |
9 | 3661315368232 |
10 | 1057019896865 |
11 | 3783091a23a9 |
12 | 150a359a9255 |
13 | 788a44b999a |
14 | 392351d2969 |
15 | 1c767555845 |
hex | f61b4ba421 |
1057019896865 has 8 divisors (see below), whose sum is σ = 1268439403968. Its totient is φ = 845605565680.
The previous prime is 1057019896859. The next prime is 1057019896871. The reversal of 1057019896865 is 5686989107501.
It is an interprime number because it is at equal distance from previous prime (1057019896859) and next prime (1057019896871).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1057019896865 - 212 = 1057019892769 is a prime.
It is a super-2 number, since 2×10570198968652 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 829541 + ... + 1673970.
It is an arithmetic number, because the mean of its divisors is an integer number (158554925496).
Almost surely, 21057019896865 is an apocalyptic number.
It is an amenable number.
1057019896865 is a deficient number, since it is larger than the sum of its proper divisors (211419507103).
1057019896865 is an equidigital number, since it uses as much as digits as its factorization.
1057019896865 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2587959.
The product of its (nonzero) digits is 32659200, while the sum is 65.
The spelling of 1057019896865 in words is "one trillion, fifty-seven billion, nineteen million, eight hundred ninety-six thousand, eight hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •