Base | Representation |
---|---|
bin | 11101001110011000011… |
… | …00001111010000000111 |
3 | 10112222220011021210211121 |
4 | 32213030030033100013 |
5 | 112423001200441411 |
6 | 2045145050414411 |
7 | 132355564601413 |
oct | 16471414172007 |
9 | 3488804253747 |
10 | 1004153140231 |
11 | 35794a2a669a |
12 | 142740a31407 |
13 | 738ca848577 |
14 | 3685bc61d43 |
15 | 1b1c118b571 |
hex | e9cc30f407 |
1004153140231 has 2 divisors, whose sum is σ = 1004153140232. Its totient is φ = 1004153140230.
The previous prime is 1004153140223. The next prime is 1004153140241. The reversal of 1004153140231 is 1320413514001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1004153140231 - 23 = 1004153140223 is a prime.
It is a super-2 number, since 2×10041531402312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1004153140196 and 1004153140205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1004153140241) 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 as a sum of consecutive naturals, namely, 502076570115 + 502076570116.
It is an arithmetic number, because the mean of its divisors is an integer number (502076570116).
Almost surely, 21004153140231 is an apocalyptic number.
1004153140231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1004153140231 is an equidigital number, since it uses as much as digits as its factorization.
1004153140231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 1004153140231 its reverse (1320413514001), we get a palindrome (2324566654232).
The spelling of 1004153140231 in words is "one trillion, four billion, one hundred fifty-three million, one hundred forty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •