Base | Representation |
---|---|
bin | 1111011001100000000… |
… | …11110000100010111101 |
3 | 1212120200000001002010202 |
4 | 13230300003300202331 |
5 | 32132032320102203 |
6 | 1043020452213245 |
7 | 53140163404130 |
oct | 7546003604275 |
9 | 1776600032122 |
10 | 529087269053 |
11 | 194425a74232 |
12 | 8665a30a225 |
13 | 3ab7b3ac895 |
14 | 1b87235a217 |
15 | db69568388 |
hex | 7b300f08bd |
529087269053 has 16 divisors (see below), whose sum is σ = 609160015104. Its totient is φ = 450137554560.
The previous prime is 529087269043. The next prime is 529087269089. The reversal of 529087269053 is 350962780925.
It is a cyclic number.
It is not a de Polignac number, because 529087269053 - 224 = 529070491837 is a prime.
It is a super-2 number, since 2×5290872690532 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 529087269053.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (529087269043) 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 15 ways as a sum of consecutive naturals, for example, 8982368 + ... + 9041078.
It is an arithmetic number, because the mean of its divisors is an integer number (38072500944).
Almost surely, 2529087269053 is an apocalyptic number.
It is an amenable number.
529087269053 is a deficient number, since it is larger than the sum of its proper divisors (80072746051).
529087269053 is a wasteful number, since it uses less digits than its factorization.
529087269053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68252.
The product of its (nonzero) digits is 8164800, while the sum is 56.
The spelling of 529087269053 in words is "five hundred twenty-nine billion, eighty-seven million, two hundred sixty-nine thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •