Base | Representation |
---|---|
bin | 1001111010100110… |
… | …10010110001111011 |
3 | 111201222222112011010 |
4 | 10331103102301323 |
5 | 41400244411011 |
6 | 2240123405003 |
7 | 245630311020 |
oct | 47523226173 |
9 | 14658875133 |
10 | 5323435131 |
11 | 2291a38673 |
12 | 1046983763 |
13 | 66ab73521 |
14 | 387015547 |
15 | 2125441a6 |
hex | 13d4d2c7b |
5323435131 has 64 divisors (see below), whose sum is σ = 8818799616. Its totient is φ = 2786918400.
The previous prime is 5323435127. The next prime is 5323435153. The reversal of 5323435131 is 1315343235.
It is not a de Polignac number, because 5323435131 - 22 = 5323435127 is a prime.
It is a super-2 number, since 2×53234351312 = 56677923187929974322, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5323435111) 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 63 ways as a sum of consecutive naturals, for example, 8304571 + ... + 8305211.
It is an arithmetic number, because the mean of its divisors is an integer number (137793744).
Almost surely, 25323435131 is an apocalyptic number.
5323435131 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
5323435131 is a deficient number, since it is larger than the sum of its proper divisors (3495364485).
5323435131 is a wasteful number, since it uses less digits than its factorization.
5323435131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1252.
The product of its digits is 16200, while the sum is 30.
The square root of 5323435131 is about 72961.8745030581. The cubic root of 5323435131 is about 1746.0794005976.
Adding to 5323435131 its reverse (1315343235), we get a palindrome (6638778366).
The spelling of 5323435131 in words is "five billion, three hundred twenty-three million, four hundred thirty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •