Base | Representation |
---|---|
bin | 1010000011101111… |
… | …10001000001000111 |
3 | 111221100020202111001 |
4 | 11001313301001013 |
5 | 42024411330111 |
6 | 2251502554131 |
7 | 250551064306 |
oct | 50167610107 |
9 | 14840222431 |
10 | 5400105031 |
11 | 2321244922 |
12 | 1068598947 |
13 | 680a08c29 |
14 | 39329243d |
15 | 21913b1c1 |
hex | 141df1047 |
5400105031 has 4 divisors (see below), whose sum is σ = 5400254272. Its totient is φ = 5399955792.
The previous prime is 5400105019. The next prime is 5400105037. The reversal of 5400105031 is 1305010045.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 5400105031 - 25 = 5400104999 is a prime.
It is a super-2 number, since 2×54001050312 = 58322268691663021922, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5400105037) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17866 + ... + 105448.
It is an arithmetic number, because the mean of its divisors is an integer number (1350063568).
Almost surely, 25400105031 is an apocalyptic number.
5400105031 is a deficient number, since it is larger than the sum of its proper divisors (149241).
5400105031 is an equidigital number, since it uses as much as digits as its factorization.
5400105031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149240.
The product of its (nonzero) digits is 300, while the sum is 19.
The square root of 5400105031 is about 73485.4069254570. The cubic root of 5400105031 is about 1754.4220173913.
Adding to 5400105031 its reverse (1305010045), we get a palindrome (6705115076).
The spelling of 5400105031 in words is "five billion, four hundred million, one hundred five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •