Base | Representation |
---|---|
bin | 110011011101001101… |
… | …110110000010101001 |
3 | 12021121112111200112101 |
4 | 303131031312002221 |
5 | 1401123224022023 |
6 | 41214300413401 |
7 | 3664112523031 |
oct | 633515660251 |
9 | 167545450471 |
10 | 55251001513 |
11 | 21482828224 |
12 | a85b547261 |
13 | 5296901b06 |
14 | 2961c8c8c1 |
15 | 168587c1ad |
hex | cdd3760a9 |
55251001513 has 4 divisors (see below), whose sum is σ = 55251510160. Its totient is φ = 55250492868.
The previous prime is 55251001489. The next prime is 55251001529. The reversal of 55251001513 is 31510015255.
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 a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 55251001513 - 213 = 55250993321 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (55251001613) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18495 + ... + 332932.
It is an arithmetic number, because the mean of its divisors is an integer number (13812877540).
Almost surely, 255251001513 is an apocalyptic number.
It is an amenable number.
55251001513 is a deficient number, since it is larger than the sum of its proper divisors (508647).
55251001513 is a wasteful number, since it uses less digits than its factorization.
55251001513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 508646.
The product of its (nonzero) digits is 3750, while the sum is 28.
Adding to 55251001513 its reverse (31510015255), we get a palindrome (86761016768).
The spelling of 55251001513 in words is "fifty-five billion, two hundred fifty-one million, one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •