Base | Representation |
---|---|
bin | 11101001110001011010… |
… | …00000110010011111101 |
3 | 10112222121111001021010211 |
4 | 32213011220012103331 |
5 | 112422240002100013 |
6 | 2045130114032421 |
7 | 132353056466122 |
oct | 16470550062375 |
9 | 3488544037124 |
10 | 1004043003133 |
11 | 3578a3110aa5 |
12 | 14270bb78711 |
13 | 738b0a959a1 |
14 | 3684b392749 |
15 | 1b1b668323d |
hex | e9c5a064fd |
1004043003133 has 4 divisors (see below), whose sum is σ = 1013984023068. Its totient is φ = 994101983200.
The previous prime is 1004043003127. The next prime is 1004043003151. The reversal of 1004043003133 is 3313003404001.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 756713831449 + 247329171684 = 869893^2 + 497322^2 .
It is a cyclic number.
It is not a de Polignac number, because 1004043003133 - 217 = 1004042872061 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 (1004073003133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4970509816 + ... + 4970510017.
It is an arithmetic number, because the mean of its divisors is an integer number (253496005767).
Almost surely, 21004043003133 is an apocalyptic number.
It is an amenable number.
1004043003133 is a deficient number, since it is larger than the sum of its proper divisors (9941019935).
1004043003133 is an equidigital number, since it uses as much as digits as its factorization.
1004043003133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9941019934.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 1004043003133 its reverse (3313003404001), we get a palindrome (4317046407134).
The spelling of 1004043003133 in words is "one trillion, four billion, forty-three million, three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •