Base | Representation |
---|---|
bin | 101011101100011… |
… | …0011100111001111 |
3 | 10210011202122110000 |
4 | 1113120303213033 |
5 | 11000311330110 |
6 | 401252015343 |
7 | 51221551146 |
oct | 12730634717 |
9 | 3704678400 |
10 | 1466120655 |
11 | 69265016a |
12 | 34b001553 |
13 | 1a498c61c |
14 | dca0475d |
15 | 88aa61c0 |
hex | 576339cf |
1466120655 has 40 divisors (see below), whose sum is σ = 2766495600. Its totient is φ = 740772864.
The previous prime is 1466120651. The next prime is 1466120657. The reversal of 1466120655 is 5560216641.
1466120655 is digitally balanced in base 6, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1466120655 - 22 = 1466120651 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1466120651) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 87570 + ... + 102959.
It is an arithmetic number, because the mean of its divisors is an integer number (69162390).
Almost surely, 21466120655 is an apocalyptic number.
1466120655 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1466120655 is a deficient number, since it is larger than the sum of its proper divisors (1300374945).
1466120655 is a wasteful number, since it uses less digits than its factorization.
1466120655 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190565 (or 190556 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 36.
The square root of 1466120655 is about 38289.9550143376. The cubic root of 1466120655 is about 1136.0302715331.
The spelling of 1466120655 in words is "one billion, four hundred sixty-six million, one hundred twenty thousand, six hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •