Base | Representation |
---|---|
bin | 1001100110011000… |
… | …00011100100001001 |
3 | 111022011201102100221 |
4 | 10303030003210021 |
5 | 41023331000031 |
6 | 2211223030041 |
7 | 241500166543 |
oct | 46314034411 |
9 | 14264642327 |
10 | 5153765641 |
11 | 2205191452 |
12 | bb9b9b321 |
13 | 64197878b |
14 | 36c68a693 |
15 | 2026cba11 |
hex | 133303909 |
5153765641 has 16 divisors (see below), whose sum is σ = 5514179328. Its totient is φ = 4804940800.
The previous prime is 5153765627. The next prime is 5153765663. The reversal of 5153765641 is 1465673515.
It is a cyclic number.
It is not a de Polignac number, because 5153765641 - 215 = 5153732873 is a prime.
It is a super-2 number, since 2×51537656412 = 53122600564704281762, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5153765341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1423065 + ... + 1426681.
It is an arithmetic number, because the mean of its divisors is an integer number (344636208).
Almost surely, 25153765641 is an apocalyptic number.
It is an amenable number.
5153765641 is a deficient number, since it is larger than the sum of its proper divisors (360413687).
5153765641 is a wasteful number, since it uses less digits than its factorization.
5153765641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5192.
The product of its digits is 378000, while the sum is 43.
The square root of 5153765641 is about 71789.7321418600. The cubic root of 5153765641 is about 1727.3283007530.
The spelling of 5153765641 in words is "five billion, one hundred fifty-three million, seven hundred sixty-five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •