Base | Representation |
---|---|
bin | 1010010000011001… |
… | …11000100001100101 |
3 | 112012202002020012221 |
4 | 11020030320201211 |
5 | 42234103212401 |
6 | 2310215112341 |
7 | 253310545504 |
oct | 51014704145 |
9 | 15182066187 |
10 | 5506304101 |
11 | 237618a851 |
12 | 10980726b1 |
13 | 699a1020c |
14 | 3a341883b |
15 | 2236177a1 |
hex | 148338865 |
5506304101 has 4 divisors (see below), whose sum is σ = 5796109600. Its totient is φ = 5216498604.
The previous prime is 5506304099. The next prime is 5506304107. The reversal of 5506304101 is 1014036055.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 1014036055 = 5 ⋅202807211.
It is a cyclic number.
It is not a de Polignac number, because 5506304101 - 21 = 5506304099 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5506304107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 144902721 + ... + 144902758.
It is an arithmetic number, because the mean of its divisors is an integer number (1449027400).
Almost surely, 25506304101 is an apocalyptic number.
It is an amenable number.
5506304101 is a deficient number, since it is larger than the sum of its proper divisors (289805499).
5506304101 is a wasteful number, since it uses less digits than its factorization.
5506304101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 289805498.
The product of its (nonzero) digits is 1800, while the sum is 25.
The square root of 5506304101 is about 74204.4749391841. The cubic root of 5506304101 is about 1765.8483244730.
The spelling of 5506304101 in words is "five billion, five hundred six million, three hundred four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •