Base | Representation |
---|---|
bin | 1010001011101100… |
… | …11101010011001001 |
3 | 112002222212211011011 |
4 | 11011312131103021 |
5 | 42144004332420 |
6 | 2302250003521 |
7 | 252321431242 |
oct | 50566352311 |
9 | 15088784134 |
10 | 5466870985 |
11 | 23559a70a4 |
12 | 1086a165a1 |
13 | 6917b4704 |
14 | 39c0b1cc9 |
15 | 21ee2895a |
hex | 145d9d4c9 |
5466870985 has 8 divisors (see below), whose sum is σ = 6568780680. Its totient is φ = 4367806464.
The previous prime is 5466870979. The next prime is 5466870991. The reversal of 5466870985 is 5890786645.
It is an interprime number because it is at equal distance from previous prime (5466870979) and next prime (5466870991).
It can be written as a sum of positive squares in 4 ways, for example, as 706974921 + 4759896064 = 26589^2 + 68992^2 .
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 5466870985 - 215 = 5466838217 is a prime.
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 7 ways as a sum of consecutive naturals, for example, 707062 + ... + 714751.
It is an arithmetic number, because the mean of its divisors is an integer number (821097585).
Almost surely, 25466870985 is an apocalyptic number.
It is an amenable number.
5466870985 is a deficient number, since it is larger than the sum of its proper divisors (1101909695).
5466870985 is a wasteful number, since it uses less digits than its factorization.
5466870985 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1422587.
The product of its (nonzero) digits is 14515200, while the sum is 58.
The square root of 5466870985 is about 73938.2917370966. The cubic root of 5466870985 is about 1761.6228773488.
The spelling of 5466870985 in words is "five billion, four hundred sixty-six million, eight hundred seventy thousand, nine hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •