Base | Representation |
---|---|
bin | 10111110010101111101100… |
… | …00010100100011000001101 |
3 | 20212020211222010101222111011 |
4 | 23321113312002210120031 |
5 | 23324212130333013010 |
6 | 303135554234525221 |
7 | 14010035145225163 |
oct | 1371276602443015 |
9 | 225224863358434 |
10 | 52321124501005 |
11 | 1574229a854468 |
12 | 5a50226896811 |
13 | 2326b2643c589 |
14 | ccc4da99b233 |
15 | 60aed4b3ca8a |
hex | 2f95f60a460d |
52321124501005 has 32 divisors (see below), whose sum is σ = 64218403307520. Its totient is φ = 40904277437760.
The previous prime is 52321124500993. The next prime is 52321124501017. The reversal of 52321124501005 is 50010542112325.
52321124501005 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (52321124500993) and next prime (52321124501017).
It is not a de Polignac number, because 52321124501005 - 241 = 50122101245453 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 416218272 + ... + 416343958.
It is an arithmetic number, because the mean of its divisors is an integer number (2006825103360).
Almost surely, 252321124501005 is an apocalyptic number.
It is an amenable number.
52321124501005 is a deficient number, since it is larger than the sum of its proper divisors (11897278806515).
52321124501005 is a wasteful number, since it uses less digits than its factorization.
52321124501005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128409.
The product of its (nonzero) digits is 12000, while the sum is 31.
The spelling of 52321124501005 in words is "fifty-two trillion, three hundred twenty-one billion, one hundred twenty-four million, five hundred one thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •