Base | Representation |
---|---|
bin | 1010000011110111… |
… | …01111010001001001 |
3 | 111221102012200000210 |
4 | 11001323233101021 |
5 | 42030143141231 |
6 | 2251541151333 |
7 | 250562662425 |
oct | 50173572111 |
9 | 14842180023 |
10 | 5401146441 |
11 | 2321896299 |
12 | 10689bb549 |
13 | 680cb1c52 |
14 | 393483b85 |
15 | 219294a46 |
hex | 141eef449 |
5401146441 has 8 divisors (see below), whose sum is σ = 7449857280. Its totient is φ = 3476599952.
The previous prime is 5401146437. The next prime is 5401146479. The reversal of 5401146441 is 1446411045.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5401146441 - 22 = 5401146437 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5401146399 and 5401146408.
It is not an unprimeable number, because it can be changed into a prime (5401146431) 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 7 ways as a sum of consecutive naturals, for example, 31040985 + ... + 31041158.
It is an arithmetic number, because the mean of its divisors is an integer number (931232160).
Almost surely, 25401146441 is an apocalyptic number.
It is an amenable number.
5401146441 is a deficient number, since it is larger than the sum of its proper divisors (2048710839).
5401146441 is a wasteful number, since it uses less digits than its factorization.
5401146441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62082175.
The product of its (nonzero) digits is 7680, while the sum is 30.
The square root of 5401146441 is about 73492.4924124907. The cubic root of 5401146441 is about 1754.5347902099.
Adding to 5401146441 its reverse (1446411045), we get a palindrome (6847557486).
The spelling of 5401146441 in words is "five billion, four hundred one million, one hundred forty-six thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •