Base | Representation |
---|---|
bin | 1001100011111001… |
… | …11101100011011001 |
3 | 111020201201000200000 |
4 | 10301330331203121 |
5 | 41003024003031 |
6 | 2205202403213 |
7 | 241126022553 |
oct | 46174754331 |
9 | 14221630600 |
10 | 5133031641 |
11 | 21a450a711 |
12 | bb3060509 |
13 | 63a59923a |
14 | 369a104d3 |
15 | 2009833e6 |
hex | 131f3d8d9 |
5133031641 has 24 divisors (see below), whose sum is σ = 7696276224. Its totient is φ = 3418776720.
The previous prime is 5133031627. The next prime is 5133031649. The reversal of 5133031641 is 1461303315.
5133031641 is a `hidden beast` number, since 5 + 13 + 3 + 0 + 3 + 1 + 641 = 666.
It is not a de Polignac number, because 5133031641 - 26 = 5133031577 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (5133031649) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 261976 + ... + 280886.
It is an arithmetic number, because the mean of its divisors is an integer number (320678176).
Almost surely, 25133031641 is an apocalyptic number.
It is an amenable number.
5133031641 is a deficient number, since it is larger than the sum of its proper divisors (2563244583).
5133031641 is a wasteful number, since it uses less digits than its factorization.
5133031641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20043 (or 20031 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 27.
The square root of 5133031641 is about 71645.1787701029. The cubic root of 5133031641 is about 1725.0087954183.
Adding to 5133031641 its reverse (1461303315), we get a palindrome (6594334956).
The spelling of 5133031641 in words is "five billion, one hundred thirty-three million, thirty-one thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •