Base | Representation |
---|---|
bin | 1010001111110001… |
… | …01001100011101011 |
3 | 112012101002202020121 |
4 | 11013320221203223 |
5 | 42231223444130 |
6 | 2305505304111 |
7 | 253214504425 |
oct | 50770514353 |
9 | 15171082217 |
10 | 5500999915 |
11 | 2373197724 |
12 | 1096335037 |
13 | 6988a3b48 |
14 | 3a2837815 |
15 | 222e1ad7a |
hex | 147e298eb |
5500999915 has 4 divisors (see below), whose sum is σ = 6601199904. Its totient is φ = 4400799928.
The previous prime is 5500999891. The next prime is 5500999919. The reversal of 5500999915 is 5199990055.
5500999915 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5500999915 - 221 = 5498902763 is a prime.
It is a super-3 number, since 3×55009999153 (a number of 30 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5500999919) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 550099987 + ... + 550099996.
It is an arithmetic number, because the mean of its divisors is an integer number (1650299976).
Almost surely, 25500999915 is an apocalyptic number.
5500999915 is a deficient number, since it is larger than the sum of its proper divisors (1100199989).
5500999915 is a wasteful number, since it uses less digits than its factorization.
5500999915 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1100199988.
The product of its (nonzero) digits is 820125, while the sum is 52.
The square root of 5500999915 is about 74168.7259901368. The cubic root of 5500999915 is about 1765.2811323404.
The spelling of 5500999915 in words is "five billion, five hundred million, nine hundred ninety-nine thousand, nine hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •