Base | Representation |
---|---|
bin | 1010000101100001… |
… | …10010110100001001 |
3 | 111222101101021102211 |
4 | 11002300302310021 |
5 | 42042223221401 |
6 | 2253155225121 |
7 | 251122130125 |
oct | 50260626411 |
9 | 14871337384 |
10 | 5415054601 |
11 | 2329725740 |
12 | 10715a81a1 |
13 | 683b41628 |
14 | 395264585 |
15 | 21a5e0951 |
hex | 142c32d09 |
5415054601 has 8 divisors (see below), whose sum is σ = 5908220064. Its totient is φ = 4922037120.
The previous prime is 5415054559. The next prime is 5415054613. The reversal of 5415054601 is 1064505145.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5415054601 - 219 = 5414530313 is a prime.
It is a super-2 number, since 2×54150546012 = 58645632663622538402, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5415054641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48030 + ... + 114616.
It is an arithmetic number, because the mean of its divisors is an integer number (738527508).
Almost surely, 25415054601 is an apocalyptic number.
It is an amenable number.
5415054601 is a deficient number, since it is larger than the sum of its proper divisors (493165463).
5415054601 is a wasteful number, since it uses less digits than its factorization.
5415054601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73991.
The product of its (nonzero) digits is 12000, while the sum is 31.
The square root of 5415054601 is about 73587.0545748367. The cubic root of 5415054601 is about 1756.0394975964.
Adding to 5415054601 its reverse (1064505145), we get a palindrome (6479559746).
The spelling of 5415054601 in words is "five billion, four hundred fifteen million, fifty-four thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •