Base | Representation |
---|---|
bin | 111001001000110000… |
… | …100000110111100111 |
3 | 12212100121021001100012 |
4 | 321020300200313213 |
5 | 2001121124003424 |
6 | 44103420040435 |
7 | 4301213154641 |
oct | 711060406747 |
9 | 185317231305 |
10 | 61350219239 |
11 | 24022665831 |
12 | ba8209311b |
13 | 5a293c929a |
14 | 2d7dd27891 |
15 | 18e1062b0e |
hex | e48c20de7 |
61350219239 has 8 divisors (see below), whose sum is σ = 62998811568. Its totient is φ = 59722364160.
The previous prime is 61350219209. The next prime is 61350219269. The reversal of 61350219239 is 93291205316.
It is an interprime number because it is at equal distance from previous prime (61350219209) and next prime (61350219269).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 61350219239 - 216 = 61350153703 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 61350219196 and 61350219205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61350219209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5178317 + ... + 5190150.
It is an arithmetic number, because the mean of its divisors is an integer number (7874851446).
Almost surely, 261350219239 is an apocalyptic number.
61350219239 is a deficient number, since it is larger than the sum of its proper divisors (1648592329).
61350219239 is a wasteful number, since it uses less digits than its factorization.
61350219239 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10368625.
The product of its (nonzero) digits is 87480, while the sum is 41.
The spelling of 61350219239 in words is "sixty-one billion, three hundred fifty million, two hundred nineteen thousand, two hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •