Base | Representation |
---|---|
bin | 1010001001110000… |
… | …01100110100010001 |
3 | 112001212011122201102 |
4 | 11010320030310101 |
5 | 42130320104140 |
6 | 2300504114145 |
7 | 252032625626 |
oct | 50470146421 |
9 | 15055148642 |
10 | 5450550545 |
11 | 234776a330 |
12 | 1081465955 |
13 | 68b2bc04b |
14 | 399c6434d |
15 | 21d7a2e15 |
hex | 144e0cd11 |
5450550545 has 16 divisors (see below), whose sum is σ = 7144552512. Its totient is φ = 3958877760.
The previous prime is 5450550529. The next prime is 5450550583.
5450550545 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 5450550545 - 24 = 5450550529 is a prime.
It is a super-3 number, since 3×54505505453 (a number of 30 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5450550499 and 5450550508.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 21587 + ... + 106616.
It is an arithmetic number, because the mean of its divisors is an integer number (446534532).
Almost surely, 25450550545 is an apocalyptic number.
5450550545 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5450550545 is a deficient number, since it is larger than the sum of its proper divisors (1694001967).
5450550545 is a wasteful number, since it uses less digits than its factorization.
5450550545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128992.
The product of its (nonzero) digits is 250000, while the sum is 38.
The square root of 5450550545 is about 73827.8439682482. The cubic root of 5450550545 is about 1759.8681186692.
The spelling of 5450550545 in words is "five billion, four hundred fifty million, five hundred fifty thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •