Base | Representation |
---|---|
bin | 10000001010001010010… |
… | …11011011001011111111 |
3 | 1222002002122012122020111 |
4 | 20011011023123023333 |
5 | 33044033104412111 |
6 | 1103021031130451 |
7 | 55053441032014 |
oct | 10050513331377 |
9 | 1862078178214 |
10 | 555211404031 |
11 | 1a45113aa529 |
12 | 8b72b213a27 |
13 | 4048279730b |
14 | 1cc2db2570b |
15 | e697c8ca21 |
hex | 81452db2ff |
555211404031 has 4 divisors (see below), whose sum is σ = 568123297192. Its totient is φ = 542299510872.
The previous prime is 555211404019. The next prime is 555211404037. The reversal of 555211404031 is 130404112555.
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 555211404031 - 213 = 555211395839 is a prime.
It is a super-2 number, since 2×5552114040312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 555211403984 and 555211404002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (555211404037) 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, 6455946516 + ... + 6455946601.
It is an arithmetic number, because the mean of its divisors is an integer number (142030824298).
Almost surely, 2555211404031 is an apocalyptic number.
555211404031 is a deficient number, since it is larger than the sum of its proper divisors (12911893161).
555211404031 is a wasteful number, since it uses less digits than its factorization.
555211404031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12911893160.
The product of its (nonzero) digits is 12000, while the sum is 31.
Adding to 555211404031 its reverse (130404112555), we get a palindrome (685615516586).
The spelling of 555211404031 in words is "five hundred fifty-five billion, two hundred eleven million, four hundred four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •