Base | Representation |
---|---|
bin | 10001100011101000000… |
… | …10001100010001010001 |
3 | 2010200001222112111100111 |
4 | 20301310002030101101 |
5 | 34340414442344131 |
6 | 1141043044521321 |
7 | 61403621461153 |
oct | 10616402142121 |
9 | 2120058474314 |
10 | 603242153041 |
11 | 212919518120 |
12 | 98ab46b0241 |
13 | 44b68567868 |
14 | 212a8ac2ad3 |
15 | 10a597e5ab1 |
hex | 8c7408c451 |
603242153041 has 4 divisors (see below), whose sum is σ = 658082348784. Its totient is φ = 548401957300.
The previous prime is 603242153023. The next prime is 603242153071. The reversal of 603242153041 is 140351242306.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 603242153041 - 25 = 603242153009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 603242152994 and 603242153012.
It is not an unprimeable number, because it can be changed into a prime (603242153071) 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, 27420097855 + ... + 27420097876.
It is an arithmetic number, because the mean of its divisors is an integer number (164520587196).
Almost surely, 2603242153041 is an apocalyptic number.
It is an amenable number.
603242153041 is a deficient number, since it is larger than the sum of its proper divisors (54840195743).
603242153041 is a wasteful number, since it uses less digits than its factorization.
603242153041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54840195742.
The product of its (nonzero) digits is 17280, while the sum is 31.
Adding to 603242153041 its reverse (140351242306), we get a palindrome (743593395347).
The spelling of 603242153041 in words is "six hundred three billion, two hundred forty-two million, one hundred fifty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •