Base | Representation |
---|---|
bin | 11101010000101101010… |
… | …01001100100011000001 |
3 | 10120010010012200220212210 |
4 | 32220112221030203001 |
5 | 112433030433322223 |
6 | 2045513031212333 |
7 | 132431543036244 |
oct | 16502651144301 |
9 | 3503105626783 |
10 | 1005402245313 |
11 | 3584303a1844 |
12 | 142a2b2170a9 |
13 | 73a695739bb |
14 | 36939ad525b |
15 | 1b245b76893 |
hex | ea16a4c8c1 |
1005402245313 has 4 divisors (see below), whose sum is σ = 1340536327088. Its totient is φ = 670268163540.
The previous prime is 1005402245279. The next prime is 1005402245317. The reversal of 1005402245313 is 3135422045001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 1005402245313 - 224 = 1005385468097 is a prime.
It is a super-3 number, since 3×10054022453133 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1005402245317) 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 3 ways as a sum of consecutive naturals, for example, 167567040883 + ... + 167567040888.
It is an arithmetic number, because the mean of its divisors is an integer number (335134081772).
Almost surely, 21005402245313 is an apocalyptic number.
It is an amenable number.
1005402245313 is a deficient number, since it is larger than the sum of its proper divisors (335134081775).
1005402245313 is an equidigital number, since it uses as much as digits as its factorization.
1005402245313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 335134081774.
The product of its (nonzero) digits is 14400, while the sum is 30.
The spelling of 1005402245313 in words is "one trillion, five billion, four hundred two million, two hundred forty-five thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •