Base | Representation |
---|---|
bin | 11001010000001001010011… |
… | …01011110111011100011011 |
3 | 21021121122111021121201212121 |
4 | 30220010221223313130123 |
5 | 24234302104333111011 |
6 | 314034140535122111 |
7 | 14460635245022335 |
oct | 1450045153673433 |
9 | 237548437551777 |
10 | 55530331535131 |
11 | 1676a31052a352 |
12 | 628a197813337 |
13 | 24ca6458b981b |
14 | d9d97a680455 |
15 | 664710c7ae71 |
hex | 328129af771b |
55530331535131 has 8 divisors (see below), whose sum is σ = 55617074530560. Its totient is φ = 55443591366888.
The previous prime is 55530331535093. The next prime is 55530331535149. The reversal of 55530331535131 is 13153513303555.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 55530331535131 - 213 = 55530331526939 is a prime.
It is a super-2 number, since 2×555303315351312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (55530331565131) 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, 40479060 + ... + 41828398.
It is an arithmetic number, because the mean of its divisors is an integer number (6952134316320).
Almost surely, 255530331535131 is an apocalyptic number.
55530331535131 is a deficient number, since it is larger than the sum of its proper divisors (86742995429).
55530331535131 is a wasteful number, since it uses less digits than its factorization.
55530331535131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1413593.
The product of its (nonzero) digits is 759375, while the sum is 43.
Adding to 55530331535131 its reverse (13153513303555), we get a palindrome (68683844838686).
The spelling of 55530331535131 in words is "fifty-five trillion, five hundred thirty billion, three hundred thirty-one million, five hundred thirty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •