Base | Representation |
---|---|
bin | 11001001000000011101011… |
… | …01010101101001101100111 |
3 | 21020122002012002022001120121 |
4 | 30210001311222231031213 |
5 | 24220223440424102010 |
6 | 313302341214142411 |
7 | 14431566544042303 |
oct | 1444016552551547 |
9 | 236562162261517 |
10 | 55252433425255 |
11 | 16672475271250 |
12 | 62443601b1a07 |
13 | 24aa388a65b11 |
14 | d90336a42d03 |
15 | 65c398b253da |
hex | 324075aad367 |
55252433425255 has 32 divisors (see below), whose sum is σ = 75200848128000. Its totient is φ = 38607577948800.
The previous prime is 55252433425201. The next prime is 55252433425313.
55252433425255 is nontrivially palindromic in base 10.
55252433425255 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 55252433425255 - 225 = 55252399870823 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 116331780 + ... + 116805769.
It is an arithmetic number, because the mean of its divisors is an integer number (2350026504000).
Almost surely, 255252433425255 is an apocalyptic number.
55252433425255 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
55252433425255 is a deficient number, since it is larger than the sum of its proper divisors (19948414702745).
55252433425255 is a wasteful number, since it uses less digits than its factorization.
55252433425255 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 233137735.
The product of its digits is 36000000, while the sum is 52.
The spelling of 55252433425255 in words is "fifty-five trillion, two hundred fifty-two billion, four hundred thirty-three million, four hundred twenty-five thousand, two hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •