Base | Representation |
---|---|
bin | 11000000011000001000100… |
… | …10000111111000100011001 |
3 | 20221020022001220121010212221 |
4 | 30001200202100333010121 |
5 | 23412342133312220304 |
6 | 304244500101104041 |
7 | 14065316645411365 |
oct | 1401404220770431 |
9 | 227208056533787 |
10 | 52880212226329 |
11 | 15938410243504 |
12 | 5b206580b8021 |
13 | 2367776013b17 |
14 | d0b5b74402a5 |
15 | 61a807d70054 |
hex | 30182243f119 |
52880212226329 has 4 divisors (see below), whose sum is σ = 52894539028240. Its totient is φ = 52865885424420.
The previous prime is 52880212226297. The next prime is 52880212226371. The reversal of 52880212226329 is 92362221208825.
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 52880212226329 - 25 = 52880212226297 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (52880212226399) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7163395419 + ... + 7163402800.
It is an arithmetic number, because the mean of its divisors is an integer number (13223634757060).
Almost surely, 252880212226329 is an apocalyptic number.
It is an amenable number.
52880212226329 is a deficient number, since it is larger than the sum of its proper divisors (14326801911).
52880212226329 is a wasteful number, since it uses less digits than its factorization.
52880212226329 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14326801910.
The product of its (nonzero) digits is 3317760, while the sum is 52.
The spelling of 52880212226329 in words is "fifty-two trillion, eight hundred eighty billion, two hundred twelve million, two hundred twenty-six thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •