Base | Representation |
---|---|
bin | 1001110000011000… |
… | …00000001000110001 |
3 | 111112000112120011210 |
4 | 10320030000020301 |
5 | 41211313401211 |
6 | 2223420430333 |
7 | 243536120463 |
oct | 47014001061 |
9 | 14460476153 |
10 | 5237637681 |
11 | 2248567791 |
12 | 10220a83a9 |
13 | 6561633c3 |
14 | 379880133 |
15 | 209c479a6 |
hex | 138300231 |
5237637681 has 4 divisors (see below), whose sum is σ = 6983516912. Its totient is φ = 3491758452.
The previous prime is 5237637659. The next prime is 5237637683. The reversal of 5237637681 is 1867367325.
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.
It is not a de Polignac number, because 5237637681 - 25 = 5237637649 is a prime.
It is a super-2 number, since 2×52376376812 = 54865696954862115522, which 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 5237637681.
It is not an unprimeable number, because it can be changed into a prime (5237637683) 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, 872939611 + ... + 872939616.
It is an arithmetic number, because the mean of its divisors is an integer number (1745879228).
Almost surely, 25237637681 is an apocalyptic number.
It is an amenable number.
5237637681 is a deficient number, since it is larger than the sum of its proper divisors (1745879231).
5237637681 is a wasteful number, since it uses less digits than its factorization.
5237637681 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1745879230.
The product of its digits is 1270080, while the sum is 48.
The square root of 5237637681 is about 72371.5253466444. The cubic root of 5237637681 is about 1736.6480677337.
The spelling of 5237637681 in words is "five billion, two hundred thirty-seven million, six hundred thirty-seven thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •