Base | Representation |
---|---|
bin | 1010000011101111… |
… | …10001000010010111 |
3 | 111221100020202121000 |
4 | 11001313301002113 |
5 | 42024411330421 |
6 | 2251502554343 |
7 | 250551064452 |
oct | 50167610227 |
9 | 14840222530 |
10 | 5400105111 |
11 | 2321244995 |
12 | 10685989b3 |
13 | 680a08c8b |
14 | 393292499 |
15 | 21913b226 |
hex | 141df1097 |
5400105111 has 8 divisors (see below), whose sum is σ = 8000155760. Its totient is φ = 3600070056.
The previous prime is 5400105107. The next prime is 5400105229. The reversal of 5400105111 is 1115010045.
It is a happy number.
5400105111 is a `hidden beast` number, since 540 + 0 + 10 + 5 + 111 = 666.
It is not a de Polignac number, because 5400105111 - 22 = 5400105107 is a prime.
It is a super-2 number, since 2×54001051112 = 58322270419696644642, 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 (5400101111) 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, 100001920 + ... + 100001973.
It is an arithmetic number, because the mean of its divisors is an integer number (1000019470).
Almost surely, 25400105111 is an apocalyptic number.
5400105111 is a deficient number, since it is larger than the sum of its proper divisors (2600050649).
5400105111 is a wasteful number, since it uses less digits than its factorization.
5400105111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 200003902 (or 200003896 counting only the distinct ones).
The product of its (nonzero) digits is 100, while the sum is 18.
The square root of 5400105111 is about 73485.4074697827. The cubic root of 5400105111 is about 1754.4220260549.
Adding to 5400105111 its reverse (1115010045), we get a palindrome (6515115156).
The spelling of 5400105111 in words is "five billion, four hundred million, one hundred five thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •