Base | Representation |
---|---|
bin | 10000011100011001011… |
… | …011010111101110110101 |
3 | 11000000201212000022021202 |
4 | 100130121123113232311 |
5 | 122003221232114331 |
6 | 2223041034022245 |
7 | 144432346025261 |
oct | 20343133275665 |
9 | 4000655008252 |
10 | 1130003004341 |
11 | 3a6260267252 |
12 | 163003877985 |
13 | 82735982993 |
14 | 3c99a0950a1 |
15 | 1e5d99beecb |
hex | 107196d7bb5 |
1130003004341 has 2 divisors, whose sum is σ = 1130003004342. Its totient is φ = 1130003004340.
The previous prime is 1130003004323. The next prime is 1130003004457. The reversal of 1130003004341 is 1434003000311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1130000890225 + 2114116 = 1063015^2 + 1454^2 .
It is a cyclic number.
It is not a de Polignac number, because 1130003004341 - 222 = 1129998810037 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1130003001341) 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 as a sum of consecutive naturals, namely, 565001502170 + 565001502171.
It is an arithmetic number, because the mean of its divisors is an integer number (565001502171).
Almost surely, 21130003004341 is an apocalyptic number.
It is an amenable number.
1130003004341 is a deficient number, since it is larger than the sum of its proper divisors (1).
1130003004341 is an equidigital number, since it uses as much as digits as its factorization.
1130003004341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 1130003004341 its reverse (1434003000311), we get a palindrome (2564006004652).
The spelling of 1130003004341 in words is "one trillion, one hundred thirty billion, three million, four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •