Base | Representation |
---|---|
bin | 110011001111110000… |
… | …001110011100011101 |
3 | 12021000210111101122112 |
4 | 303033300032130131 |
5 | 1400142413231331 |
6 | 41140031323405 |
7 | 3655400626163 |
oct | 631760163435 |
9 | 167023441575 |
10 | 55025133341 |
11 | 21377287112 |
12 | a7b7980565 |
13 | 525bb8b3c9 |
14 | 293dc95233 |
15 | 1670b1332b |
hex | ccfc0e71d |
55025133341 has 4 divisors (see below), whose sum is σ = 55026061500. Its totient is φ = 55024205184.
The previous prime is 55025133337. The next prime is 55025133403. The reversal of 55025133341 is 14333152055.
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 18105048025 + 36920085316 = 134555^2 + 192146^2 .
It is a cyclic number.
It is not a de Polignac number, because 55025133341 - 22 = 55025133337 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 55025133298 and 55025133307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55025133301) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 368606 + ... + 495903.
It is an arithmetic number, because the mean of its divisors is an integer number (13756515375).
Almost surely, 255025133341 is an apocalyptic number.
It is an amenable number.
55025133341 is a deficient number, since it is larger than the sum of its proper divisors (928159).
55025133341 is an equidigital number, since it uses as much as digits as its factorization.
55025133341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 928158.
The product of its (nonzero) digits is 27000, while the sum is 32.
Adding to 55025133341 its reverse (14333152055), we get a palindrome (69358285396).
The spelling of 55025133341 in words is "fifty-five billion, twenty-five million, one hundred thirty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •