Base | Representation |
---|---|
bin | 10001110111101110000… |
… | …11011111010100111011 |
3 | 2011200220211020020211201 |
4 | 20323313003133110323 |
5 | 40030013220240011 |
6 | 1150025343035031 |
7 | 62235145643644 |
oct | 10736703372473 |
9 | 2150824206751 |
10 | 614030243131 |
11 | 217455078958 |
12 | 9b00559ba77 |
13 | 45b975c7c16 |
14 | 21a0d7906cb |
15 | 10e8b976cc1 |
hex | 8ef70df53b |
614030243131 has 8 divisors (see below), whose sum is σ = 614382808320. Its totient is φ = 613677749352.
The previous prime is 614030243119. The next prime is 614030243153. The reversal of 614030243131 is 131342030416.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-614030243131 is a prime.
It is a super-2 number, since 2×6140302431312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 614030243131.
It is not an unprimeable number, because it can be changed into a prime (614030244131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33879690 + ... + 33897808.
It is an arithmetic number, because the mean of its divisors is an integer number (76797851040).
Almost surely, 2614030243131 is an apocalyptic number.
614030243131 is a deficient number, since it is larger than the sum of its proper divisors (352565189).
614030243131 is a wasteful number, since it uses less digits than its factorization.
614030243131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35705.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 614030243131 its reverse (131342030416), we get a palindrome (745372273547).
The spelling of 614030243131 in words is "six hundred fourteen billion, thirty million, two hundred forty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •