Base | Representation |
---|---|
bin | 111001010001110001… |
… | …000110100001101111 |
3 | 12212202010200020001102 |
4 | 321101301012201233 |
5 | 2001423322242211 |
6 | 44130415433315 |
7 | 4305030002066 |
oct | 712161064157 |
9 | 185663606042 |
10 | 61501368431 |
11 | 2409aa12418 |
12 | bb0482583b |
13 | 5a5180b289 |
14 | 2d960311dd |
15 | 18ee46ca3b |
hex | e51c4686f |
61501368431 has 4 divisors (see below), whose sum is σ = 61678606152. Its totient is φ = 61324130712.
The previous prime is 61501368407. The next prime is 61501368463. The reversal of 61501368431 is 13486310516.
61501368431 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 is a cyclic number.
It is not a de Polignac number, because 61501368431 - 210 = 61501367407 is a prime.
It is a super-2 number, since 2×615013684312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61501368031) 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, 88618340 + ... + 88619033.
It is an arithmetic number, because the mean of its divisors is an integer number (15419651538).
Almost surely, 261501368431 is an apocalyptic number.
61501368431 is a deficient number, since it is larger than the sum of its proper divisors (177237721).
61501368431 is a wasteful number, since it uses less digits than its factorization.
61501368431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 177237720.
The product of its (nonzero) digits is 51840, while the sum is 38.
Adding to 61501368431 its reverse (13486310516), we get a palindrome (74987678947).
The spelling of 61501368431 in words is "sixty-one billion, five hundred one million, three hundred sixty-eight thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •