Base | Representation |
---|---|
bin | 111000110111001010… |
… | …100010001101101001 |
3 | 12211121000211221002102 |
4 | 320313022202031221 |
5 | 2000020043104401 |
6 | 44014233343145 |
7 | 4261000236656 |
oct | 706712421551 |
9 | 184530757072 |
10 | 61055050601 |
11 | 23990a91206 |
12 | b9bb267ab5 |
13 | 59b020059c |
14 | 2d52a50c2d |
15 | 18c51aa56b |
hex | e372a2369 |
61055050601 has 4 divisors (see below), whose sum is σ = 61058964804. Its totient is φ = 61051136400.
The previous prime is 61055050597. The next prime is 61055050621. The reversal of 61055050601 is 10605055016.
61055050601 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 42075855376 + 18979195225 = 205124^2 + 137765^2 .
It is a cyclic number.
It is not a de Polignac number, because 61055050601 - 22 = 61055050597 is a prime.
It is a super-2 number, since 2×610550506012 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (61055050621) 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, 1933610 + ... + 1964931.
It is an arithmetic number, because the mean of its divisors is an integer number (15264741201).
Almost surely, 261055050601 is an apocalyptic number.
It is an amenable number.
61055050601 is a deficient number, since it is larger than the sum of its proper divisors (3914203).
61055050601 is a wasteful number, since it uses less digits than its factorization.
61055050601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3914202.
The product of its (nonzero) digits is 4500, while the sum is 29.
The spelling of 61055050601 in words is "sixty-one billion, fifty-five million, fifty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •