Base | Representation |
---|---|
bin | 11101001110001010111… |
… | …00110001000010010011 |
3 | 10112222121021110100001210 |
4 | 32213011130301002103 |
5 | 112422233222014103 |
6 | 2045125530231203 |
7 | 132353022314112 |
oct | 16470534610223 |
9 | 3488537410053 |
10 | 1004040032403 |
11 | 3578a1472051 |
12 | 14270ab85503 |
13 | 738b0295765 |
14 | 3684ac1bc79 |
15 | 1b1b6297e03 |
hex | e9c5731093 |
1004040032403 has 4 divisors (see below), whose sum is σ = 1338720043208. Its totient is φ = 669360021600.
The previous prime is 1004040032381. The next prime is 1004040032417. The reversal of 1004040032403 is 3042300404001.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 1004040032403 - 214 = 1004040016019 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1004040032403.
It is not an unprimeable number, because it can be changed into a prime (1004040032453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 167340005398 + ... + 167340005403.
It is an arithmetic number, because the mean of its divisors is an integer number (334680010802).
Almost surely, 21004040032403 is an apocalyptic number.
1004040032403 is a deficient number, since it is larger than the sum of its proper divisors (334680010805).
1004040032403 is an equidigital number, since it uses as much as digits as its factorization.
1004040032403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 334680010804.
The product of its (nonzero) digits is 1152, while the sum is 21.
Adding to 1004040032403 its reverse (3042300404001), we get a palindrome (4046340436404).
The spelling of 1004040032403 in words is "one trillion, four billion, forty million, thirty-two thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •