Base | Representation |
---|---|
bin | 11001001100111110010000… |
… | …01010111011110101110011 |
3 | 21021020020010011200112212001 |
4 | 30212133020022323311303 |
5 | 24231010331230030120 |
6 | 313512111544114431 |
7 | 14450026002410323 |
oct | 1446371012736563 |
9 | 237206104615761 |
10 | 55421321330035 |
11 | 16728061072861 |
12 | 6271034465a17 |
13 | 24c0292495a9b |
14 | d98598b0d283 |
15 | 6619809eae0a |
hex | 3267c82bbd73 |
55421321330035 has 8 divisors (see below), whose sum is σ = 68127673049856. Its totient is φ = 43255665428160.
The previous prime is 55421321330033. The next prime is 55421321330051. The reversal of 55421321330035 is 53003312312455.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 55421321330035 - 21 = 55421321330033 is a prime.
It is a super-2 number, since 2×554213213300352 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 55421321329976 and 55421321330003.
It is not an unprimeable number, because it can be changed into a prime (55421321330033) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 135173954259 + ... + 135173954668.
It is an arithmetic number, because the mean of its divisors is an integer number (8515959131232).
Almost surely, 255421321330035 is an apocalyptic number.
55421321330035 is a deficient number, since it is larger than the sum of its proper divisors (12706351719821).
55421321330035 is a wasteful number, since it uses less digits than its factorization.
55421321330035 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 270347908973.
The product of its (nonzero) digits is 162000, while the sum is 37.
The spelling of 55421321330035 in words is "fifty-five trillion, four hundred twenty-one billion, three hundred twenty-one million, three hundred thirty thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •