Base | Representation |
---|---|
bin | 11101011111011011010… |
… | …00111001000110100101 |
3 | 10120212111220200120002110 |
4 | 32233231220321012211 |
5 | 113100221341000110 |
6 | 2053301110231233 |
7 | 133131423610311 |
oct | 16575550710645 |
9 | 3525456616073 |
10 | 1013304234405 |
11 | 360815907141 |
12 | 144475655519 |
13 | 747286bb7a8 |
14 | 37089368b41 |
15 | 1b559761a20 |
hex | ebeda391a5 |
1013304234405 has 8 divisors (see below), whose sum is σ = 1621286775072. Its totient is φ = 540428925008.
The previous prime is 1013304234391. The next prime is 1013304234421. The reversal of 1013304234405 is 5044324033101.
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 1013304234405 - 27 = 1013304234277 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33776807799 + ... + 33776807828.
It is an arithmetic number, because the mean of its divisors is an integer number (202660846884).
Almost surely, 21013304234405 is an apocalyptic number.
1013304234405 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1013304234405 is a deficient number, since it is larger than the sum of its proper divisors (607982540667).
1013304234405 is an equidigital number, since it uses as much as digits as its factorization.
1013304234405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67553615635.
The product of its (nonzero) digits is 17280, while the sum is 30.
Adding to 1013304234405 its reverse (5044324033101), we get a palindrome (6057628267506).
The spelling of 1013304234405 in words is "one trillion, thirteen billion, three hundred four million, two hundred thirty-four thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •