Base | Representation |
---|---|
bin | 10000000101010111111… |
… | …01011000110010100101 |
3 | 1221211110111011221100200 |
4 | 20002223331120302211 |
5 | 33023302021411044 |
6 | 1101514002301113 |
7 | 54632645244141 |
oct | 10025375306245 |
9 | 1854414157320 |
10 | 552640810149 |
11 | 1a341236a27a |
12 | 8b132357799 |
13 | 4016304bc4c |
14 | 1ca6857a221 |
15 | e59726a369 |
hex | 80abf58ca5 |
552640810149 has 12 divisors (see below), whose sum is σ = 802042168512. Its totient is φ = 366681105000.
The previous prime is 552640810129. The next prime is 552640810157. The reversal of 552640810149 is 941018046255.
552640810149 is a `hidden beast` number, since 5 + 526 + 4 + 0 + 81 + 0 + 1 + 49 = 666.
It is not a de Polignac number, because 552640810149 - 27 = 552640810021 is a prime.
It is a super-2 number, since 2×5526408101492 (a number of 24 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (552640810129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 145506477 + ... + 145510274.
It is an arithmetic number, because the mean of its divisors is an integer number (66836847376).
Almost surely, 2552640810149 is an apocalyptic number.
It is an amenable number.
552640810149 is a deficient number, since it is larger than the sum of its proper divisors (249401358363).
552640810149 is a wasteful number, since it uses less digits than its factorization.
552640810149 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 291016968 (or 291016965 counting only the distinct ones).
The product of its (nonzero) digits is 345600, while the sum is 45.
The spelling of 552640810149 in words is "five hundred fifty-two billion, six hundred forty million, eight hundred ten thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •