Base | Representation |
---|---|
bin | 1010010000010001… |
… | …10011110101101111 |
3 | 112012200001222112001 |
4 | 11020020303311233 |
5 | 42233320030320 |
6 | 2310140153131 |
7 | 253265510464 |
oct | 51010636557 |
9 | 15180058461 |
10 | 5505236335 |
11 | 23756205a5 |
12 | 10978387a7 |
13 | 6997281c1 |
14 | 3a321b66b |
15 | 2234a620a |
hex | 148233d6f |
5505236335 has 8 divisors (see below), whose sum is σ = 6608609856. Its totient is φ = 4402638240.
The previous prime is 5505236311. The next prime is 5505236351. The reversal of 5505236335 is 5336325055.
It is a happy number.
5505236335 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 not a de Polignac number, because 5505236335 - 29 = 5505235823 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5505236294 and 5505236303.
It is a congruent number.
It is an unprimeable number.
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, 178119 + ... + 206728.
It is an arithmetic number, because the mean of its divisors is an integer number (826076232).
Almost surely, 25505236335 is an apocalyptic number.
5505236335 is a deficient number, since it is larger than the sum of its proper divisors (1103373521).
5505236335 is a wasteful number, since it uses less digits than its factorization.
5505236335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 387713.
The product of its (nonzero) digits is 202500, while the sum is 37.
The square root of 5505236335 is about 74197.2798355843. The cubic root of 5505236335 is about 1765.7341744214.
The spelling of 5505236335 in words is "five billion, five hundred five million, two hundred thirty-six thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •