Base | Representation |
---|---|
bin | 11001000010001011100011… |
… | …00001111010111110011011 |
3 | 21012220202222000222011110100 |
4 | 30201011301201322332123 |
5 | 24203421411120104210 |
6 | 313025503435550443 |
7 | 14411160502655136 |
oct | 1441056141727633 |
9 | 235822860864410 |
10 | 55050500550555 |
11 | 165a4871440744 |
12 | 62111a52bb423 |
13 | 2494317172803 |
14 | d8465bd7b21d |
15 | 656ecab4c5c0 |
hex | 32117187af9b |
55050500550555 has 24 divisors (see below), whose sum is σ = 98498960127360. Its totient is φ = 28413161573760.
The previous prime is 55050500550553. The next prime is 55050500550569. The reversal of 55050500550555 is 55505500505055.
It is not a de Polignac number, because 55050500550555 - 21 = 55050500550553 is a prime.
It is a super-2 number, since 2×550505005505552 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 55050500550555.
It is not an unprimeable number, because it can be changed into a prime (55050500550553) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 19731360810 + ... + 19731363599.
It is an arithmetic number, because the mean of its divisors is an integer number (4104123338640).
Almost surely, 255050500550555 is an apocalyptic number.
55050500550555 is a deficient number, since it is larger than the sum of its proper divisors (43448459576805).
55050500550555 is a wasteful number, since it uses less digits than its factorization.
55050500550555 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39462724451 (or 39462724448 counting only the distinct ones).
The product of its (nonzero) digits is 1953125, while the sum is 45.
The spelling of 55050500550555 in words is "fifty-five trillion, fifty billion, five hundred million, five hundred fifty thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •