Base | Representation |
---|---|
bin | 10111101111101001011001… |
… | …00101011010110010101011 |
3 | 20211212200011210212112100210 |
4 | 23313310230211122302223 |
5 | 23320441113322032133 |
6 | 303015030335232203 |
7 | 13666246041055413 |
oct | 1367645445326253 |
9 | 224780153775323 |
10 | 52214665424043 |
11 | 1570112a442231 |
12 | 5a33675978663 |
13 | 2319a8b709a05 |
14 | cc72bbb89643 |
15 | 608353837763 |
hex | 2f7d2c95acab |
52214665424043 has 4 divisors (see below), whose sum is σ = 69619553898728. Its totient is φ = 34809776949360.
The previous prime is 52214665424041. The next prime is 52214665424137. The reversal of 52214665424043 is 34042456641225.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 52214665424043 - 21 = 52214665424041 is a prime.
It is a super-2 number, since 2×522146654240432 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 52214665423983 and 52214665424001.
It is not an unprimeable number, because it can be changed into a prime (52214665424041) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8702444237338 + ... + 8702444237343.
It is an arithmetic number, because the mean of its divisors is an integer number (17404888474682).
Almost surely, 252214665424043 is an apocalyptic number.
52214665424043 is a deficient number, since it is larger than the sum of its proper divisors (17404888474685).
52214665424043 is a wasteful number, since it uses less digits than its factorization.
52214665424043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17404888474684.
The product of its (nonzero) digits is 5529600, while the sum is 48.
The spelling of 52214665424043 in words is "fifty-two trillion, two hundred fourteen billion, six hundred sixty-five million, four hundred twenty-four thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •