Base | Representation |
---|---|
bin | 1010010000100101… |
… | …11100011101101101 |
3 | 112012212001221220210 |
4 | 11020102330131231 |
5 | 42240010034401 |
6 | 2310313133033 |
7 | 253330214244 |
oct | 51022743555 |
9 | 15185057823 |
10 | 5507893101 |
11 | 2377075677 |
12 | 10986ba179 |
13 | 69a148559 |
14 | 3a370d95b |
15 | 22382d4d6 |
hex | 1484bc76d |
5507893101 has 8 divisors (see below), whose sum is σ = 7580756224. Its totient is φ = 3553479360.
The previous prime is 5507893093. The next prime is 5507893117. The reversal of 5507893101 is 1013987055.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5507893101 - 23 = 5507893093 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 5507893101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5507893141) by changing a digit.
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, 29612236 + ... + 29612421.
It is an arithmetic number, because the mean of its divisors is an integer number (947594528).
Almost surely, 25507893101 is an apocalyptic number.
It is an amenable number.
5507893101 is a deficient number, since it is larger than the sum of its proper divisors (2072863123).
5507893101 is a wasteful number, since it uses less digits than its factorization.
5507893101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59224691.
The product of its (nonzero) digits is 37800, while the sum is 39.
The square root of 5507893101 is about 74215.1810682963. The cubic root of 5507893101 is about 1766.0181699852.
The spelling of 5507893101 in words is "five billion, five hundred seven million, eight hundred ninety-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •