Base | Representation |
---|---|
bin | 1010001001101100… |
… | …00110011100000011 |
3 | 112001211010200200201 |
4 | 11010312012130003 |
5 | 42130200001011 |
6 | 2300444230031 |
7 | 252025144132 |
oct | 50466063403 |
9 | 15054120621 |
10 | 5450000131 |
11 | 2347423844 |
12 | 108123b317 |
13 | 68b158664 |
14 | 399b5d919 |
15 | 21d6e4cc1 |
hex | 144d86703 |
5450000131 has 8 divisors (see below), whose sum is σ = 5969574720. Its totient is φ = 4952535168.
The previous prime is 5450000113. The next prime is 5450000141. The reversal of 5450000131 is 1310000545.
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 5450000131 - 25 = 5450000099 is a prime.
It is a super-2 number, since 2×54500001312 = 59405002855800034322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5450000099 and 5450000108.
It is not an unprimeable number, because it can be changed into a prime (5450000111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5526891 + ... + 5527876.
It is an arithmetic number, because the mean of its divisors is an integer number (746196840).
Almost surely, 25450000131 is an apocalyptic number.
5450000131 is a deficient number, since it is larger than the sum of its proper divisors (519574589).
5450000131 is a wasteful number, since it uses less digits than its factorization.
5450000131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11054813.
The product of its (nonzero) digits is 300, while the sum is 19.
The square root of 5450000131 is about 73824.1161884110. The cubic root of 5450000131 is about 1759.8088776408.
Adding to 5450000131 its reverse (1310000545), we get a palindrome (6760000676).
The spelling of 5450000131 in words is "five billion, four hundred fifty million, one hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.627 sec. • engine limits •