Base | Representation |
---|---|
bin | 10000000010010101101… |
… | …00101010100000111101 |
3 | 1221200020220122210021022 |
4 | 20001022310222200331 |
5 | 33011432322233001 |
6 | 1101044144513525 |
7 | 54544366233233 |
oct | 10011264524075 |
9 | 1850226583238 |
10 | 551011133501 |
11 | 1a2756469074 |
12 | 8a95861b8a5 |
13 | 3cc6352543a |
14 | 1c951d5c953 |
15 | e4ee15811b |
hex | 804ad2a83d |
551011133501 has 4 divisors (see below), whose sum is σ = 563825345952. Its totient is φ = 538196921052.
The previous prime is 551011133447. The next prime is 551011133509. The reversal of 551011133501 is 105331110155.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 551011133501 - 226 = 550944024637 is a prime.
It is a super-2 number, since 2×5510111335012 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (551011133509) 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, 6407106161 + ... + 6407106246.
It is an arithmetic number, because the mean of its divisors is an integer number (140956336488).
Almost surely, 2551011133501 is an apocalyptic number.
It is an amenable number.
551011133501 is a deficient number, since it is larger than the sum of its proper divisors (12814212451).
551011133501 is a wasteful number, since it uses less digits than its factorization.
551011133501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12814212450.
The product of its (nonzero) digits is 1125, while the sum is 26.
Adding to 551011133501 its reverse (105331110155), we get a palindrome (656342243656).
The spelling of 551011133501 in words is "five hundred fifty-one billion, eleven million, one hundred thirty-three thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •