Base | Representation |
---|---|
bin | 11111000000010110000… |
… | …10110111010110101001 |
3 | 10202211211011212120020121 |
4 | 33200023002313112221 |
5 | 114423302310033201 |
6 | 2133224213123241 |
7 | 136653022462603 |
oct | 17401302672651 |
9 | 3684734776217 |
10 | 1065337189801 |
11 | 380897085715 |
12 | 152577329521 |
13 | 795cb6a3ab1 |
14 | 397c3a92173 |
15 | 1caa28289a1 |
hex | f80b0b75a9 |
1065337189801 has 8 divisors (see below), whose sum is σ = 1085338837440. Its totient is φ = 1045400378448.
The previous prime is 1065337189783. The next prime is 1065337189817. The reversal of 1065337189801 is 1089817335601.
1065337189801 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1065337189801 - 211 = 1065337187753 is a prime.
It is a super-2 number, since 2×10653371898012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1065337189871) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16175901 + ... + 16241626.
It is an arithmetic number, because the mean of its divisors is an integer number (135667354680).
Almost surely, 21065337189801 is an apocalyptic number.
It is an amenable number.
1065337189801 is a deficient number, since it is larger than the sum of its proper divisors (20001647639).
1065337189801 is an equidigital number, since it uses as much as digits as its factorization.
1065337189801 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32418143.
The product of its (nonzero) digits is 1088640, while the sum is 52.
The spelling of 1065337189801 in words is "one trillion, sixty-five billion, three hundred thirty-seven million, one hundred eighty-nine thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •