Base | Representation |
---|---|
bin | 10000000110101001010… |
… | …00010011101011001111 |
3 | 1221220020001010101201011 |
4 | 20003110220103223033 |
5 | 33031201211300111 |
6 | 1102105415230051 |
7 | 54655602113221 |
oct | 10032450235317 |
9 | 1856201111634 |
10 | 553323150031 |
11 | 1a3732547333 |
12 | 8b2a2978327 |
13 | 40241516c62 |
14 | 1cad1038411 |
15 | e5d7100021 |
hex | 80d4a13acf |
553323150031 has 4 divisors (see below), whose sum is σ = 553696766064. Its totient is φ = 552949534000.
The previous prime is 553323150011. The next prime is 553323150041. The reversal of 553323150031 is 130051323355.
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 553323150031 - 211 = 553323147983 is a prime.
It is a super-2 number, since 2×5533231500312 (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 = 553323149975 and 553323150002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (553323150011) 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, 186805795 + ... + 186808756.
It is an arithmetic number, because the mean of its divisors is an integer number (138424191516).
Almost surely, 2553323150031 is an apocalyptic number.
553323150031 is a deficient number, since it is larger than the sum of its proper divisors (373616033).
553323150031 is a wasteful number, since it uses less digits than its factorization.
553323150031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 373616032.
The product of its (nonzero) digits is 20250, while the sum is 31.
Adding to 553323150031 its reverse (130051323355), we get a palindrome (683374473386).
The spelling of 553323150031 in words is "five hundred fifty-three billion, three hundred twenty-three million, one hundred fifty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •