Base | Representation |
---|---|
bin | 1110100100010110001… |
… | …10111011011010000001 |
3 | 1202212000012020102121102 |
4 | 13102023012323122001 |
5 | 31200111303234203 |
6 | 1021541032504145 |
7 | 51110045162012 |
oct | 7221306733201 |
9 | 1685005212542 |
10 | 500550055553 |
11 | 183311503369 |
12 | 8101524b055 |
13 | 382810aa632 |
14 | 1a3262c9009 |
15 | d049087888 |
hex | 748b1bb681 |
500550055553 has 4 divisors (see below), whose sum is σ = 500737459968. Its totient is φ = 500362651140.
The previous prime is 500550055543. The next prime is 500550055559. The reversal of 500550055553 is 355550055005.
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.
It is a cyclic number.
It is not a de Polignac number, because 500550055553 - 212 = 500550051457 is a prime.
It is a super-2 number, since 2×5005500555532 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (500550055559) 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, 93698201 + ... + 93703542.
It is an arithmetic number, because the mean of its divisors is an integer number (125184364992).
Almost surely, 2500550055553 is an apocalyptic number.
It is an amenable number.
500550055553 is a deficient number, since it is larger than the sum of its proper divisors (187404415).
500550055553 is a wasteful number, since it uses less digits than its factorization.
500550055553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 187404414.
The product of its (nonzero) digits is 234375, while the sum is 38.
The spelling of 500550055553 in words is "five hundred billion, five hundred fifty million, fifty-five thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •