Base | Representation |
---|---|
bin | 11001000001000000011000… |
… | …11111000110000011010101 |
3 | 21012202220210222102112220212 |
4 | 30200200030133012003111 |
5 | 24202241242023330023 |
6 | 312555151520335205 |
7 | 14405231546045012 |
oct | 1440401437060325 |
9 | 235686728375825 |
10 | 55010150605013 |
11 | 165897459a540a |
12 | 6205404174505 |
13 | 2490586755aa6 |
14 | d82711118709 |
15 | 655e1858ce78 |
hex | 32080c7c60d5 |
55010150605013 has 2 divisors, whose sum is σ = 55010150605014. Its totient is φ = 55010150605012.
The previous prime is 55010150604953. The next prime is 55010150605117. The reversal of 55010150605013 is 31050605101055.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 54467839134289 + 542311470724 = 7380233^2 + 736418^2 .
It is a cyclic number.
It is not a de Polignac number, because 55010150605013 - 28 = 55010150604757 is a prime.
It is a super-2 number, since 2×550101506050132 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (55010150608013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27505075302506 + 27505075302507.
It is an arithmetic number, because the mean of its divisors is an integer number (27505075302507).
Almost surely, 255010150605013 is an apocalyptic number.
It is an amenable number.
55010150605013 is a deficient number, since it is larger than the sum of its proper divisors (1).
55010150605013 is an equidigital number, since it uses as much as digits as its factorization.
55010150605013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11250, while the sum is 32.
Adding to 55010150605013 its reverse (31050605101055), we get a palindrome (86060755706068).
The spelling of 55010150605013 in words is "fifty-five trillion, ten billion, one hundred fifty million, six hundred five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •