Base | Representation |
---|---|
bin | 10000000011010001101… |
… | …11111100100000110101 |
3 | 1221201120001100121120220 |
4 | 20001220313330200311 |
5 | 33014000404411013 |
6 | 1101210155044553 |
7 | 54563030534034 |
oct | 10015067744065 |
9 | 1851501317526 |
10 | 551515310133 |
11 | 1a2995018477 |
12 | 8aa79440759 |
13 | 40013b105c8 |
14 | 1c99ccc071b |
15 | e52d548b23 |
hex | 8068dfc835 |
551515310133 has 8 divisors (see below), whose sum is σ = 735390432000. Its totient is φ = 367658530848.
The previous prime is 551515310107. The next prime is 551515310149. The reversal of 551515310133 is 331013515155.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 551515310133 - 216 = 551515244597 is a prime.
It is a super-2 number, since 2×5515153101332 (a number of 24 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 551515310094 and 551515310103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (551515360133) 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, 4515333 + ... + 4635866.
It is an arithmetic number, because the mean of its divisors is an integer number (91923804000).
Almost surely, 2551515310133 is an apocalyptic number.
It is an amenable number.
551515310133 is a deficient number, since it is larger than the sum of its proper divisors (183875121867).
551515310133 is a wasteful number, since it uses less digits than its factorization.
551515310133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9171291.
The product of its (nonzero) digits is 16875, while the sum is 33.
Adding to 551515310133 its reverse (331013515155), we get a palindrome (882528825288).
The spelling of 551515310133 in words is "five hundred fifty-one billion, five hundred fifteen million, three hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •