Base | Representation |
---|---|
bin | 11011010011110011011000… |
… | …10100111001101001101101 |
3 | 21212122010000000021200022110 |
4 | 31221321230110321221231 |
5 | 30332411143314313041 |
6 | 331420241052434233 |
7 | 15435522226561563 |
oct | 1551715424715155 |
9 | 255563000250273 |
10 | 60054050151021 |
11 | 18153863782603 |
12 | 689aa63a78979 |
13 | 27680c374b984 |
14 | 10b88bad13a33 |
15 | 6e2224cc7516 |
hex | 369e6c539a6d |
60054050151021 has 8 divisors (see below), whose sum is σ = 80121708577440. Its totient is φ = 40011212579312.
The previous prime is 60054050150999. The next prime is 60054050151041. The reversal of 60054050151021 is 12015105045006.
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 60054050151021 - 221 = 60054048053869 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 60054050151021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (60054050151041) 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, 6205208031 + ... + 6205217708.
It is an arithmetic number, because the mean of its divisors is an integer number (10015213572180).
Almost surely, 260054050151021 is an apocalyptic number.
It is an amenable number.
60054050151021 is a deficient number, since it is larger than the sum of its proper divisors (20067658426419).
60054050151021 is a wasteful number, since it uses less digits than its factorization.
60054050151021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12410427355.
The product of its (nonzero) digits is 6000, while the sum is 30.
Adding to 60054050151021 its reverse (12015105045006), we get a palindrome (72069155196027).
The spelling of 60054050151021 in words is "sixty trillion, fifty-four billion, fifty million, one hundred fifty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •