Base | Representation |
---|---|
bin | 1001110111111110… |
… | …11100011001000001 |
3 | 111200110121210021000 |
4 | 10323333130121001 |
5 | 41324133020101 |
6 | 2234020322213 |
7 | 245242422165 |
oct | 47377343101 |
9 | 14613553230 |
10 | 5301454401 |
11 | 2280595181 |
12 | 103b543369 |
13 | 666448689 |
14 | 384132ca5 |
15 | 210651486 |
hex | 13bfdc641 |
5301454401 has 16 divisors (see below), whose sum is σ = 7866478720. Its totient is φ = 3528690480.
The previous prime is 5301454397. The next prime is 5301454409. The reversal of 5301454401 is 1044541035.
It is a happy number.
It is not a de Polignac number, because 5301454401 - 22 = 5301454397 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (5301454409) 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 15 ways as a sum of consecutive naturals, for example, 138550 + ... + 172623.
It is an arithmetic number, because the mean of its divisors is an integer number (491654920).
Almost surely, 25301454401 is an apocalyptic number.
It is an amenable number.
5301454401 is a deficient number, since it is larger than the sum of its proper divisors (2565024319).
5301454401 is a wasteful number, since it uses less digits than its factorization.
5301454401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 311813 (or 311807 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
The square root of 5301454401 is about 72811.0870747031. The cubic root of 5301454401 is about 1743.6728689204.
Adding to 5301454401 its reverse (1044541035), we get a palindrome (6345995436).
The spelling of 5301454401 in words is "five billion, three hundred one million, four hundred fifty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •