Base | Representation |
---|---|
bin | 11011011111011111010011… |
… | …01011111001011110101100 |
3 | 21221001111102200111012022021 |
4 | 31233233221223321132230 |
5 | 30411001014313241111 |
6 | 332324525032155524 |
7 | 15506525522132110 |
oct | 1557575153713654 |
9 | 257044380435267 |
10 | 60455585290156 |
11 | 18299084905731 |
12 | 6944845238ba4 |
13 | 2796c25133464 |
14 | 10d00ccd25740 |
15 | 6ec8c635bd71 |
hex | 36fbe9af97ac |
60455585290156 has 24 divisors (see below), whose sum is σ = 121049039695136. Its totient is φ = 25879993171200.
The previous prime is 60455585290153. The next prime is 60455585290159. The reversal of 60455585290156 is 65109258555406.
It is an interprime number because it is at equal distance from previous prime (60455585290153) and next prime (60455585290159).
It is a junction number, because it is equal to n+sod(n) for n = 60455585290094 and 60455585290103.
It is not an unprimeable number, because it can be changed into a prime (60455585290153) 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 in 7 ways as a sum of consecutive naturals, for example, 1230949245 + ... + 1230998356.
Almost surely, 260455585290156 is an apocalyptic number.
It is an amenable number.
60455585290156 is an abundant number, since it is smaller than the sum of its proper divisors (60593454404980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
60455585290156 is a wasteful number, since it uses less digits than its factorization.
60455585290156 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2461948489 (or 2461948487 counting only the distinct ones).
The product of its (nonzero) digits is 64800000, while the sum is 61.
The spelling of 60455585290156 in words is "sixty trillion, four hundred fifty-five billion, five hundred eighty-five million, two hundred ninety thousand, one hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •