Base | Representation |
---|---|
bin | 11101001000100111110… |
… | …01000010101111001101 |
3 | 10112200220200001220201022 |
4 | 32210103321002233031 |
5 | 112400133120203433 |
6 | 2043514153323525 |
7 | 132216140646326 |
oct | 16442371025715 |
9 | 3480820056638 |
10 | 1001061100493 |
11 | 356602991453 |
12 | 1420194065a5 |
13 | 7352707985c |
14 | 3664733b44d |
15 | 1b08e9b6698 |
hex | e913e42bcd |
1001061100493 has 8 divisors (see below), whose sum is σ = 1017489247800. Its totient is φ = 984633511680.
The previous prime is 1001061100489. The next prime is 1001061100499. The reversal of 1001061100493 is 3940011601001.
It can be written as a sum of positive squares in 4 ways, for example, as 1744983529 + 999316116964 = 41773^2 + 999658^2 .
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 1001061100493 - 22 = 1001061100489 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1001061100499) 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, 5034833 + ... + 5229881.
It is an arithmetic number, because the mean of its divisors is an integer number (127186155975).
Almost surely, 21001061100493 is an apocalyptic number.
It is an amenable number.
1001061100493 is a deficient number, since it is larger than the sum of its proper divisors (16428147307).
1001061100493 is an equidigital number, since it uses as much as digits as its factorization.
1001061100493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 279247.
The product of its (nonzero) digits is 648, while the sum is 26.
Adding to 1001061100493 its reverse (3940011601001), we get a palindrome (4941072701494).
The spelling of 1001061100493 in words is "one trillion, one billion, sixty-one million, one hundred thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •