Base | Representation |
---|---|
bin | 11101001110010110000… |
… | …00100110000010010101 |
3 | 10112222211202222100201022 |
4 | 32213023000212002111 |
5 | 112422431111414423 |
6 | 2045143101410525 |
7 | 132355234212206 |
oct | 16471300460225 |
9 | 3488752870638 |
10 | 1004133310613 |
11 | 35793a092384 |
12 | 142736269a45 |
13 | 738c66c4874 |
14 | 3685937d5ad |
15 | 1b1be570dc8 |
hex | e9cb026095 |
1004133310613 has 8 divisors (see below), whose sum is σ = 1023259553568. Its totient is φ = 985013746704.
The previous prime is 1004133310561. The next prime is 1004133310633. The reversal of 1004133310613 is 3160133314001.
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 1004133310613 - 28 = 1004133310357 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1004133310633) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1365695 + ... + 1968092.
It is an arithmetic number, because the mean of its divisors is an integer number (127907444196).
Almost surely, 21004133310613 is an apocalyptic number.
It is an amenable number.
1004133310613 is a deficient number, since it is larger than the sum of its proper divisors (19126242955).
1004133310613 is an equidigital number, since it uses as much as digits as its factorization.
1004133310613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3339523.
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 1004133310613 its reverse (3160133314001), we get a palindrome (4164266624614).
The spelling of 1004133310613 in words is "one trillion, four billion, one hundred thirty-three million, three hundred ten thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •