Base | Representation |
---|---|
bin | 110011010111001110… |
… | …000101101010011001 |
3 | 12021100112012201012221 |
4 | 303113032011222121 |
5 | 1400422000332301 |
6 | 41200304304041 |
7 | 3661451453416 |
oct | 632716055231 |
9 | 167315181187 |
10 | 55150402201 |
11 | 21430a674a4 |
12 | a831912021 |
13 | 527bb0b5ab |
14 | 295278310d |
15 | 167bb09da1 |
hex | cd7385a99 |
55150402201 has 4 divisors (see below), whose sum is σ = 56495534004. Its totient is φ = 53805270400.
The previous prime is 55150402189. The next prime is 55150402273. The reversal of 55150402201 is 10220405155.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 29462006025 + 25688396176 = 171645^2 + 160276^2 .
It is a cyclic number.
It is not a de Polignac number, because 55150402201 - 211 = 55150400153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (55150402301) 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, 672565840 + ... + 672565921.
It is an arithmetic number, because the mean of its divisors is an integer number (14123883501).
Almost surely, 255150402201 is an apocalyptic number.
It is an amenable number.
55150402201 is a deficient number, since it is larger than the sum of its proper divisors (1345131803).
55150402201 is a wasteful number, since it uses less digits than its factorization.
55150402201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1345131802.
The product of its (nonzero) digits is 2000, while the sum is 25.
Adding to 55150402201 its reverse (10220405155), we get a palindrome (65370807356).
The spelling of 55150402201 in words is "fifty-five billion, one hundred fifty million, four hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •