Base | Representation |
---|---|
bin | 1010001000100000… |
… | …11011110001100101 |
3 | 112001010120001000010 |
4 | 11010100123301211 |
5 | 42120133013203 |
6 | 2255452440433 |
7 | 251545210545 |
oct | 50420336145 |
9 | 15033501003 |
10 | 5440126053 |
11 | 234189a24a |
12 | 1079a79119 |
13 | 6890ac1cb |
14 | 39870d325 |
15 | 21c8e4303 |
hex | 14441bc65 |
5440126053 has 4 divisors (see below), whose sum is σ = 7253501408. Its totient is φ = 3626750700.
The previous prime is 5440126039. The next prime is 5440126063. The reversal of 5440126053 is 3506210445.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 5440126053 - 216 = 5440060517 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5440126053.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5440126063) 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, 906687673 + ... + 906687678.
It is an arithmetic number, because the mean of its divisors is an integer number (1813375352).
Almost surely, 25440126053 is an apocalyptic number.
It is an amenable number.
5440126053 is a deficient number, since it is larger than the sum of its proper divisors (1813375355).
5440126053 is a wasteful number, since it uses less digits than its factorization.
5440126053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1813375354.
The product of its (nonzero) digits is 14400, while the sum is 30.
The square root of 5440126053 is about 73757.2101763617. The cubic root of 5440126053 is about 1758.7454529145.
Adding to 5440126053 its reverse (3506210445), we get a palindrome (8946336498).
The spelling of 5440126053 in words is "five billion, four hundred forty million, one hundred twenty-six thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •