Base | Representation |
---|---|
bin | 1010001111111101… |
… | …01101001100100001 |
3 | 112012111002102020202 |
4 | 11013332231030201 |
5 | 42232130301211 |
6 | 2310003314545 |
7 | 253234136453 |
oct | 50776551441 |
9 | 15174072222 |
10 | 5502587681 |
11 | 2374081628 |
12 | 109697ba55 |
13 | 69900b756 |
14 | 3a2b2c2d3 |
15 | 22313153b |
hex | 147fad321 |
5502587681 has 8 divisors (see below), whose sum is σ = 5543033184. Its totient is φ = 5462265600.
The previous prime is 5502587647. The next prime is 5502587707. The reversal of 5502587681 is 1867852055.
It is a happy number.
5502587681 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 5502587681 - 210 = 5502586657 is a prime.
It is a super-2 number, since 2×55025876812 = 60556942374185915522, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5502587621) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 59606 + ... + 120656.
It is an arithmetic number, because the mean of its divisors is an integer number (692879148).
Almost surely, 25502587681 is an apocalyptic number.
It is an amenable number.
5502587681 is a deficient number, since it is larger than the sum of its proper divisors (40445503).
5502587681 is a wasteful number, since it uses less digits than its factorization.
5502587681 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61711.
The product of its (nonzero) digits is 672000, while the sum is 47.
The square root of 5502587681 is about 74179.4289611345. The cubic root of 5502587681 is about 1765.4509550262.
The spelling of 5502587681 in words is "five billion, five hundred two million, five hundred eighty-seven thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •