Base | Representation |
---|---|
bin | 10111101010110001010110… |
… | …00110000111001010000111 |
3 | 20211021122202110001100122222 |
4 | 23311120223012013022013 |
5 | 23310220013444343044 |
6 | 302410042521442555 |
7 | 13651165365406340 |
oct | 1365305306071207 |
9 | 224248673040588 |
10 | 52047136715399 |
11 | 1564708089a911 |
12 | 5a0710094045b |
13 | 230704076cb07 |
14 | cbd14840d0c7 |
15 | 603ceae468ee |
hex | 2f562b187287 |
52047136715399 has 16 divisors (see below), whose sum is σ = 63106113331200. Its totient is φ = 41931054182304.
The previous prime is 52047136715383. The next prime is 52047136715447. The reversal of 52047136715399 is 99351763174025.
It is a happy number.
52047136715399 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 52047136715399 - 24 = 52047136715383 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52047136711399) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 1540659704 + ... + 1540693485.
It is an arithmetic number, because the mean of its divisors is an integer number (3944132083200).
Almost surely, 252047136715399 is an apocalyptic number.
52047136715399 is a deficient number, since it is larger than the sum of its proper divisors (11058976615801).
52047136715399 is a wasteful number, since it uses less digits than its factorization.
52047136715399 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3081353342.
The product of its (nonzero) digits is 42865200, while the sum is 62.
The spelling of 52047136715399 in words is "fifty-two trillion, forty-seven billion, one hundred thirty-six million, seven hundred fifteen thousand, three hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •