Base | Representation |
---|---|
bin | 1001101101100111… |
… | …11111100011111111 |
3 | 111110102010102200100 |
4 | 10312303333203333 |
5 | 41134412113110 |
6 | 2221234132143 |
7 | 243136041144 |
oct | 46663774377 |
9 | 14412112610 |
10 | 5214566655 |
11 | 223653a121 |
12 | 1016421053 |
13 | 6514461cc |
14 | 3767963cb |
15 | 207bdbbc0 |
hex | 136cff8ff |
5214566655 has 24 divisors (see below), whose sum is σ = 9570264912. Its totient is φ = 2617507584.
The previous prime is 5214566653. The next prime is 5214566657. The reversal of 5214566655 is 5566654125.
It is an interprime number because it is at equal distance from previous prime (5214566653) and next prime (5214566657).
It is not a de Polignac number, because 5214566655 - 21 = 5214566653 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 5214566655.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5214566653) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3407449 + ... + 3408978.
It is an arithmetic number, because the mean of its divisors is an integer number (398761038).
Almost surely, 25214566655 is an apocalyptic number.
5214566655 is a deficient number, since it is larger than the sum of its proper divisors (4355698257).
5214566655 is a wasteful number, since it uses less digits than its factorization.
5214566655 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6816455 (or 6816452 counting only the distinct ones).
The product of its digits is 1080000, while the sum is 45.
The square root of 5214566655 is about 72211.9564545928. The cubic root of 5214566655 is about 1734.0944212103.
The spelling of 5214566655 in words is "five billion, two hundred fourteen million, five hundred sixty-six thousand, six hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •