Base | Representation |
---|---|
bin | 1010000011111010… |
… | …00111100111100001 |
3 | 111221102220001102202 |
4 | 11001331013213201 |
5 | 42030241231241 |
6 | 2251553022545 |
7 | 250566030446 |
oct | 50175074741 |
9 | 14842801382 |
10 | 5401508321 |
11 | 2322013170 |
12 | 1068b54a55 |
13 | 6810aa891 |
14 | 3935399cd |
15 | 219316d9b |
hex | 141f479e1 |
5401508321 has 4 divisors (see below), whose sum is σ = 5892554544. Its totient is φ = 4910462100.
The previous prime is 5401508297. The next prime is 5401508353. The reversal of 5401508321 is 1238051045.
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 a cyclic number.
It is not a de Polignac number, because 5401508321 - 214 = 5401491937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5401508221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 245523095 + ... + 245523116.
It is an arithmetic number, because the mean of its divisors is an integer number (1473138636).
Almost surely, 25401508321 is an apocalyptic number.
It is an amenable number.
5401508321 is a deficient number, since it is larger than the sum of its proper divisors (491046223).
5401508321 is a wasteful number, since it uses less digits than its factorization.
5401508321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 491046222.
The product of its (nonzero) digits is 4800, while the sum is 29.
The square root of 5401508321 is about 73494.9543914410. The cubic root of 5401508321 is about 1754.5739742903.
Adding to 5401508321 its reverse (1238051045), we get a palindrome (6639559366).
The spelling of 5401508321 in words is "five billion, four hundred one million, five hundred eight thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •