Base | Representation |
---|---|
bin | 111001000010011100… |
… | …101011100011000001 |
3 | 12212002020001200101011 |
4 | 321002130223203001 |
5 | 2000412023404201 |
6 | 44045115040521 |
7 | 4265456305045 |
oct | 710234534301 |
9 | 185066050334 |
10 | 61244356801 |
11 | 23a7892a811 |
12 | ba52740141 |
13 | 5a104b22a4 |
14 | 2d6dc4c025 |
15 | 18d6b01151 |
hex | e4272b8c1 |
61244356801 has 4 divisors (see below), whose sum is σ = 61244854704. Its totient is φ = 61243858900.
The previous prime is 61244356799. The next prime is 61244356807. The reversal of 61244356801 is 10865344216.
It is a happy number.
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, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 61244356801 - 21 = 61244356799 is a prime.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (61244356807) 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, 83886 + ... + 359896.
It is an arithmetic number, because the mean of its divisors is an integer number (15311213676).
Almost surely, 261244356801 is an apocalyptic number.
It is an amenable number.
61244356801 is a deficient number, since it is larger than the sum of its proper divisors (497903).
61244356801 is a wasteful number, since it uses less digits than its factorization.
61244356801 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 497902.
The product of its (nonzero) digits is 138240, while the sum is 40.
The spelling of 61244356801 in words is "sixty-one billion, two hundred forty-four million, three hundred fifty-six thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.161 sec. • engine limits •