Base | Representation |
---|---|
bin | 110100111000000111… |
… | …1000011100010100111 |
3 | 101212002122101121122101 |
4 | 1221300033003202213 |
5 | 3330023322111201 |
6 | 124055400312531 |
7 | 11126633206006 |
oct | 1516017034247 |
9 | 355078347571 |
10 | 113552144551 |
11 | 4418025296a |
12 | 1a010472747 |
13 | a9283c2aa1 |
14 | 56d2c76c3d |
15 | 2e48da4d01 |
hex | 1a703c38a7 |
113552144551 has 4 divisors (see below), whose sum is σ = 113727650832. Its totient is φ = 113376638272.
The previous prime is 113552144543. The next prime is 113552144557. The reversal of 113552144551 is 155441255311.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 113552144551 - 23 = 113552144543 is a prime.
It is a super-4 number, since 4×1135521445514 (a number of 45 digits) contains 4444 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 113552144551.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113552144557) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 87752170 + ... + 87753463.
It is an arithmetic number, because the mean of its divisors is an integer number (28431912708).
Almost surely, 2113552144551 is an apocalyptic number.
113552144551 is a deficient number, since it is larger than the sum of its proper divisors (175506281).
113552144551 is an equidigital number, since it uses as much as digits as its factorization.
113552144551 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 175506280.
The product of its digits is 60000, while the sum is 37.
Adding to 113552144551 its reverse (155441255311), we get a palindrome (268993399862).
The spelling of 113552144551 in words is "one hundred thirteen billion, five hundred fifty-two million, one hundred forty-four thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •