Base | Representation |
---|---|
bin | 11101001110000111101… |
… | …01101001101001010111 |
3 | 10112222112101121000100221 |
4 | 32213003311221221113 |
5 | 112422204312020203 |
6 | 2045123123015211 |
7 | 132352243462204 |
oct | 16470365515127 |
9 | 3488471530327 |
10 | 1004013001303 |
11 | 35788818a1a4 |
12 | 142701b0a507 |
13 | 738a77bcc20 |
14 | 368473c2cab |
15 | 1b1b3c08abd |
hex | e9c3d69a57 |
1004013001303 has 8 divisors (see below), whose sum is σ = 1107616594896. Its totient is φ = 904176811200.
The previous prime is 1004013001289. The next prime is 1004013001337. The reversal of 1004013001303 is 3031003104001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1004013001303 - 225 = 1003979446871 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 (1004013001003) by changing a digit.
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, 941850313 + ... + 941851378.
It is an arithmetic number, because the mean of its divisors is an integer number (138452074362).
Almost surely, 21004013001303 is an apocalyptic number.
1004013001303 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1004013001303 is a deficient number, since it is larger than the sum of its proper divisors (103603593593).
1004013001303 is a wasteful number, since it uses less digits than its factorization.
1004013001303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1883701745.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 1004013001303 its reverse (3031003104001), we get a palindrome (4035016105304).
The spelling of 1004013001303 in words is "one trillion, four billion, thirteen million, one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •