Base | Representation |
---|---|
bin | 10111110000101011111111… |
… | …10100000110110010000101 |
3 | 20212000002110201021111002010 |
4 | 23320111333310012302011 |
5 | 23322032330402142131 |
6 | 303043302352404433 |
7 | 14001653103634545 |
oct | 1370257764066205 |
9 | 225002421244063 |
10 | 52250421521541 |
11 | 15715308868531 |
12 | 5a3a594546719 |
13 | 2320269481659 |
14 | cc8d10873325 |
15 | 60924796bb46 |
hex | 2f857fd06c85 |
52250421521541 has 48 divisors (see below), whose sum is σ = 72735140588544. Its totient is φ = 33346275157728.
The previous prime is 52250421521527. The next prime is 52250421521549. The reversal of 52250421521541 is 14512512405225.
It is not a de Polignac number, because 52250421521541 - 214 = 52250421505157 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 52250421521541.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52250421521549) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 93880506 + ... + 94435428.
It is an arithmetic number, because the mean of its divisors is an integer number (1515315428928).
Almost surely, 252250421521541 is an apocalyptic number.
It is an amenable number.
52250421521541 is a deficient number, since it is larger than the sum of its proper divisors (20484719067003).
52250421521541 is a wasteful number, since it uses less digits than its factorization.
52250421521541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 555238 (or 555159 counting only the distinct ones).
The product of its (nonzero) digits is 160000, while the sum is 39.
Adding to 52250421521541 its reverse (14512512405225), we get a palindrome (66762933926766).
The spelling of 52250421521541 in words is "fifty-two trillion, two hundred fifty billion, four hundred twenty-one million, five hundred twenty-one thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •