Base | Representation |
---|---|
bin | 11011011110011110111100… |
… | …01010000011010110100101 |
3 | 21220221012020121121210100020 |
4 | 31233033132022003112211 |
5 | 30404414233211124312 |
6 | 332301012230105353 |
7 | 15504163334123532 |
oct | 1557173612032645 |
9 | 256835217553306 |
10 | 60421032129957 |
11 | 18285463511a94 |
12 | 693a0014ab259 |
13 | 27938a9670c35 |
14 | 10cc571cd3d89 |
15 | 6eba52b4378c |
hex | 36f3de2835a5 |
60421032129957 has 4 divisors (see below), whose sum is σ = 80561376173280. Its totient is φ = 40280688086636.
The previous prime is 60421032129937. The next prime is 60421032129961. The reversal of 60421032129957 is 75992123012406.
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 60421032129957 - 220 = 60421031081381 is a prime.
It is a super-2 number, since 2×604210321299572 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (60421032129937) 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, 10070172021657 + ... + 10070172021662.
It is an arithmetic number, because the mean of its divisors is an integer number (20140344043320).
Almost surely, 260421032129957 is an apocalyptic number.
It is an amenable number.
60421032129957 is a deficient number, since it is larger than the sum of its proper divisors (20140344043323).
60421032129957 is a wasteful number, since it uses less digits than its factorization.
60421032129957 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20140344043322.
The product of its (nonzero) digits is 1632960, while the sum is 51.
The spelling of 60421032129957 in words is "sixty trillion, four hundred twenty-one billion, thirty-two million, one hundred twenty-nine thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •