Base | Representation |
---|---|
bin | 10111101101111011000001… |
… | …10101100111110000101001 |
3 | 20211200000020101010101021120 |
4 | 23312331200311213300221 |
5 | 23314003241102411203 |
6 | 302531511000325453 |
7 | 13662050512644543 |
oct | 1366754065476051 |
9 | 224600211111246 |
10 | 52155412544553 |
11 | 15688a9376893a |
12 | 5a2409a173889 |
13 | 23143079a9786 |
14 | cc449a618693 |
15 | 606a369b3b53 |
hex | 2f6f60d67c29 |
52155412544553 has 8 divisors (see below), whose sum is σ = 69602144882400. Its totient is φ = 34739477618208.
The previous prime is 52155412544531. The next prime is 52155412544621. The reversal of 52155412544553 is 35544521455125.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 52155412544553 - 28 = 52155412544297 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 52155412544496 and 52155412544505.
It is not an unprimeable number, because it can be changed into a prime (52155412594553) 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, 7699348923 + ... + 7699355696.
It is an arithmetic number, because the mean of its divisors is an integer number (8700268110300).
Almost surely, 252155412544553 is an apocalyptic number.
It is an amenable number.
52155412544553 is a deficient number, since it is larger than the sum of its proper divisors (17446732337847).
52155412544553 is a wasteful number, since it uses less digits than its factorization.
52155412544553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15398705751.
The product of its digits is 12000000, while the sum is 51.
Adding to 52155412544553 its reverse (35544521455125), we get a palindrome (87699933999678).
The spelling of 52155412544553 in words is "fifty-two trillion, one hundred fifty-five billion, four hundred twelve million, five hundred forty-four thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.174 sec. • engine limits •