Base | Representation |
---|---|
bin | 10111011011011011011110… |
… | …110110110001111011101001 |
3 | 111111211112021001210111101111 |
4 | 113123123132312301323221 |
5 | 102001201412102131124 |
6 | 1003051531405550321 |
7 | 30463252235465542 |
oct | 2733333666617351 |
9 | 444745231714344 |
10 | 103040004333289 |
11 | 2a917025220621 |
12 | b681a14b753a1 |
13 | 45658278b487a |
14 | 1b6323cac34c9 |
15 | bda4910a4494 |
hex | 5db6dedb1ee9 |
103040004333289 has 2 divisors, whose sum is σ = 103040004333290. Its totient is φ = 103040004333288.
The previous prime is 103040004333281. The next prime is 103040004333307. The reversal of 103040004333289 is 982333400040301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 98324418361689 + 4715585971600 = 9915867^2 + 2171540^2 .
It is an emirp because it is prime and its reverse (982333400040301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 103040004333289 - 23 = 103040004333281 is a prime.
It is not a weakly prime, because it can be changed into another prime (103040004333281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51520002166644 + 51520002166645.
It is an arithmetic number, because the mean of its divisors is an integer number (51520002166645).
Almost surely, 2103040004333289 is an apocalyptic number.
It is an amenable number.
103040004333289 is a deficient number, since it is larger than the sum of its proper divisors (1).
103040004333289 is an equidigital number, since it uses as much as digits as its factorization.
103040004333289 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 186624, while the sum is 40.
The spelling of 103040004333289 in words is "one hundred three trillion, forty billion, four million, three hundred thirty-three thousand, two hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •