Base | Representation |
---|---|
bin | 11011111011101000010100… |
… | …10101000110100100101001 |
3 | 22001110221012200020102210020 |
4 | 31331310022111012210221 |
5 | 31022321240123313301 |
6 | 334345035055111053 |
7 | 15636425552525562 |
oct | 1575641225064451 |
9 | 261427180212706 |
10 | 61422500604201 |
11 | 18631155345360 |
12 | 6a80113212489 |
13 | 2837169c41439 |
14 | 1124c17395169 |
15 | 717b18278436 |
hex | 37dd0a546929 |
61422500604201 has 32 divisors (see below), whose sum is σ = 91243694370816. Its totient is φ = 36433327008000.
The previous prime is 61422500604181. The next prime is 61422500604247. The reversal of 61422500604201 is 10240600522416.
61422500604201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 61422500604201 - 25 = 61422500604169 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (61422500604401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 210031441 + ... + 210323681.
It is an arithmetic number, because the mean of its divisors is an integer number (2851365449088).
Almost surely, 261422500604201 is an apocalyptic number.
It is an amenable number.
61422500604201 is a deficient number, since it is larger than the sum of its proper divisors (29821193766615).
61422500604201 is a wasteful number, since it uses less digits than its factorization.
61422500604201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 427813.
The product of its (nonzero) digits is 23040, while the sum is 33.
The spelling of 61422500604201 in words is "sixty-one trillion, four hundred twenty-two billion, five hundred million, six hundred four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •