Base | Representation |
---|---|
bin | 1001101101100110… |
… | …10111001001101011 |
3 | 111110101211000121211 |
4 | 10312303113021223 |
5 | 41134341314011 |
6 | 2221230413551 |
7 | 243134451442 |
oct | 46663271153 |
9 | 14411730554 |
10 | 5214401131 |
11 | 2236436825 |
12 | 10163612b7 |
13 | 6513b8a74 |
14 | 376751d59 |
15 | 207ba7b21 |
hex | 136cd726b |
5214401131 has 8 divisors (see below), whose sum is σ = 5343505200. Its totient is φ = 5086434912.
The previous prime is 5214401119. The next prime is 5214401141. The reversal of 5214401131 is 1311044125.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5214401131 - 223 = 5206012523 is a prime.
It is a super-2 number, since 2×52144011312 = 54379958309948158322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5214401111) 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 7 ways as a sum of consecutive naturals, for example, 275181 + ... + 293518.
It is an arithmetic number, because the mean of its divisors is an integer number (667938150).
Almost surely, 25214401131 is an apocalyptic number.
5214401131 is a deficient number, since it is larger than the sum of its proper divisors (129104069).
5214401131 is a wasteful number, since it uses less digits than its factorization.
5214401131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 568925.
The product of its (nonzero) digits is 480, while the sum is 22.
The square root of 5214401131 is about 72210.8103472049. The cubic root of 5214401131 is about 1734.0760727836.
Adding to 5214401131 its reverse (1311044125), we get a palindrome (6525445256).
The spelling of 5214401131 in words is "five billion, two hundred fourteen million, four hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •