Base | Representation |
---|---|
bin | 1000100101011011100011110… |
… | …0101000001001101100111001 |
3 | 2221012221220111022221122002102 |
4 | 2021112320330220021230321 |
5 | 1113140130222341210131 |
6 | 5540454055410513145 |
7 | 241150112443623365 |
oct | 21126707450115471 |
9 | 2835856438848072 |
10 | 604105347210041 |
11 | 165539703562766 |
12 | 579077b65957b5 |
13 | 1cc10b74b909b1 |
14 | a926bd78722a5 |
15 | 49c9276a511cb |
hex | 2256e3ca09b39 |
604105347210041 has 2 divisors, whose sum is σ = 604105347210042. Its totient is φ = 604105347210040.
The previous prime is 604105347209999. The next prime is 604105347210067. The reversal of 604105347210041 is 140012743501406.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 496648903355641 + 107456443854400 = 22285621^2 + 10366120^2 .
It is a cyclic number.
It is not a de Polignac number, because 604105347210041 - 234 = 604088167340857 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 604105347209977 and 604105347210004.
It is not a weakly prime, because it can be changed into another prime (604105347210091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 302052673605020 + 302052673605021.
It is an arithmetic number, because the mean of its divisors is an integer number (302052673605021).
Almost surely, 2604105347210041 is an apocalyptic number.
It is an amenable number.
604105347210041 is a deficient number, since it is larger than the sum of its proper divisors (1).
604105347210041 is an equidigital number, since it uses as much as digits as its factorization.
604105347210041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 80640, while the sum is 38.
The spelling of 604105347210041 in words is "six hundred four trillion, one hundred five billion, three hundred forty-seven million, two hundred ten thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •