Base | Representation |
---|---|
bin | 11001000010100110101001… |
… | …11101001000101110011001 |
3 | 21012222011112020222011122022 |
4 | 30201103110331020232121 |
5 | 24204141212200443113 |
6 | 313040311504504225 |
7 | 14412214234160510 |
oct | 1441232475105631 |
9 | 235864466864568 |
10 | 55065053531033 |
11 | 165aaa5a1a2337 |
12 | 6213b8701b075 |
13 | 24957c61c6670 |
14 | d8523ca7b677 |
15 | 65757d5b1908 |
hex | 3214d4f48b99 |
55065053531033 has 16 divisors (see below), whose sum is σ = 69214338977280. Its totient is φ = 42640976684736.
The previous prime is 55065053531027. The next prime is 55065053531101. The reversal of 55065053531033 is 33013535056055.
It is a cyclic number.
It is not a de Polignac number, because 55065053531033 - 228 = 55064785095577 is a prime.
It is a super-3 number, since 3×550650535310333 (a number of 42 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (55065053531003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6437341238 + ... + 6437349791.
It is an arithmetic number, because the mean of its divisors is an integer number (4325896186080).
Almost surely, 255065053531033 is an apocalyptic number.
It is an amenable number.
55065053531033 is a deficient number, since it is larger than the sum of its proper divisors (14149285446247).
55065053531033 is a wasteful number, since it uses less digits than its factorization.
55065053531033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12874691096.
The product of its (nonzero) digits is 1518750, while the sum is 44.
Adding to 55065053531033 its reverse (33013535056055), we get a palindrome (88078588587088).
The spelling of 55065053531033 in words is "fifty-five trillion, sixty-five billion, fifty-three million, five hundred thirty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.206 sec. • engine limits •