Base | Representation |
---|---|
bin | 10001100101000011111… |
… | …10111000011001000001 |
3 | 2010202001201002110111201 |
4 | 20302201332320121001 |
5 | 34344004314141441 |
6 | 1141251343341201 |
7 | 61432002050464 |
oct | 10624176703101 |
9 | 2122051073451 |
10 | 604013037121 |
11 | 2131846817aa |
12 | 9908a8b1801 |
13 | 44c5c194ca0 |
14 | 2133d22d2db |
15 | 10aa231ac31 |
hex | 8ca1fb8641 |
604013037121 has 8 divisors (see below), whose sum is σ = 650577735080. Its totient is φ = 557462932992.
The previous prime is 604013037097. The next prime is 604013037137. The reversal of 604013037121 is 121730310406.
It can be written as a sum of positive squares in 4 ways, for example, as 286480787121 + 317532250000 = 535239^2 + 563500^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 604013037121 - 213 = 604013028929 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 604013037121.
It is not an unprimeable number, because it can be changed into a prime (604013037161) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3562416 + ... + 3728113.
It is an arithmetic number, because the mean of its divisors is an integer number (81322216885).
Almost surely, 2604013037121 is an apocalyptic number.
It is an amenable number.
604013037121 is a deficient number, since it is larger than the sum of its proper divisors (46564697959).
604013037121 is a wasteful number, since it uses less digits than its factorization.
604013037121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7296915.
The product of its (nonzero) digits is 3024, while the sum is 28.
Adding to 604013037121 its reverse (121730310406), we get a palindrome (725743347527).
The spelling of 604013037121 in words is "six hundred four billion, thirteen million, thirty-seven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •