Base | Representation |
---|---|
bin | 11011111011000110011100… |
… | …00111000110000101001111 |
3 | 22001102012020222012211211210 |
4 | 31331203032013012011033 |
5 | 31022022011432230111 |
6 | 334332430100345503 |
7 | 15635213024562042 |
oct | 1575431607060517 |
9 | 261365228184753 |
10 | 61404310430031 |
11 | 18624470481268 |
12 | 6a786973a5293 |
13 | 283552b4b707a |
14 | 1123dad5c2c59 |
15 | 7174013570a6 |
hex | 37d8ce1c614f |
61404310430031 has 4 divisors (see below), whose sum is σ = 81872413906712. Its totient is φ = 40936206953352.
The previous prime is 61404310429999. The next prime is 61404310430059. The reversal of 61404310430031 is 13003401340416.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 61404310430031 - 25 = 61404310429999 is a prime.
It is a super-2 number, since 2×614043104300312 (a number of 28 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 (61404310430231) 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, 10234051738336 + ... + 10234051738341.
It is an arithmetic number, because the mean of its divisors is an integer number (20468103476678).
Almost surely, 261404310430031 is an apocalyptic number.
61404310430031 is a deficient number, since it is larger than the sum of its proper divisors (20468103476681).
61404310430031 is a wasteful number, since it uses less digits than its factorization.
61404310430031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20468103476680.
The product of its (nonzero) digits is 10368, while the sum is 30.
Adding to 61404310430031 its reverse (13003401340416), we get a palindrome (74407711770447).
The spelling of 61404310430031 in words is "sixty-one trillion, four hundred four billion, three hundred ten million, four hundred thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •