Base | Representation |
---|---|
bin | 1010000111101111… |
… | …00010110001101011 |
3 | 112000200021112111100 |
4 | 11003313202301223 |
5 | 42112000214011 |
6 | 2255100532443 |
7 | 251435563500 |
oct | 50367426153 |
9 | 15020245440 |
10 | 5433601131 |
11 | 2339142a52 |
12 | 1077851123 |
13 | 6879362ca |
14 | 3978d14a7 |
15 | 21c055d56 |
hex | 143de2c6b |
5433601131 has 72 divisors (see below), whose sum is σ = 9438075504. Its totient is φ = 3001622400.
The previous prime is 5433601099. The next prime is 5433601157. The reversal of 5433601131 is 1311063345.
5433601131 is a `hidden beast` number, since 5 + 43 + 3 + 601 + 13 + 1 = 666.
It is not a de Polignac number, because 5433601131 - 25 = 5433601099 is a prime.
It is a super-2 number, since 2×54336011312 = 59048042501608958322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5433601095 and 5433601104.
It is not an unprimeable number, because it can be changed into a prime (5433601231) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 1913845 + ... + 1916681.
It is an arithmetic number, because the mean of its divisors is an integer number (131084382).
Almost surely, 25433601131 is an apocalyptic number.
5433601131 is a deficient number, since it is larger than the sum of its proper divisors (4004474373).
5433601131 is a wasteful number, since it uses less digits than its factorization.
5433601131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3001 (or 2991 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 27.
The square root of 5433601131 is about 73712.9644703020. The cubic root of 5433601131 is about 1758.0420214225.
Adding to 5433601131 its reverse (1311063345), we get a palindrome (6744664476).
The spelling of 5433601131 in words is "five billion, four hundred thirty-three million, six hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •