Base | Representation |
---|---|
bin | 1010001011100011… |
… | …10111000001101101 |
3 | 112002220121120201221 |
4 | 11011301313001231 |
5 | 42143202300040 |
6 | 2302204103341 |
7 | 252305251156 |
oct | 50561670155 |
9 | 15086546657 |
10 | 5465665645 |
11 | 2355253550 |
12 | 1086534b51 |
13 | 691481bab |
14 | 39bc7a92d |
15 | 21ec8b74a |
hex | 145c7706d |
5465665645 has 32 divisors (see below), whose sum is σ = 7457808384. Its totient is φ = 3809332800.
The previous prime is 5465665591. The next prime is 5465665687.
5465665645 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 5465665645 - 29 = 5465665133 is a prime.
It is a super-3 number, since 3×54656656453 (a number of 30 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5465665592 and 5465665601.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 160054 + ... + 191176.
It is an arithmetic number, because the mean of its divisors is an integer number (233056512).
Almost surely, 25465665645 is an apocalyptic number.
5465665645 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5465665645 is a deficient number, since it is larger than the sum of its proper divisors (1992142739).
5465665645 is a wasteful number, since it uses less digits than its factorization.
5465665645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31273.
The product of its digits is 12960000, while the sum is 52.
The square root of 5465665645 is about 73930.1403015036. The cubic root of 5465665645 is about 1761.4933998349.
The spelling of 5465665645 in words is "five billion, four hundred sixty-five million, six hundred sixty-five thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •