Base | Representation |
---|---|
bin | 110000101000001100… |
… | …110100001100010101 |
3 | 11222202212221212001212 |
4 | 300220030310030111 |
5 | 1323413244240301 |
6 | 35553052231205 |
7 | 3525625102433 |
oct | 605014641425 |
9 | 158685855055 |
10 | 52214055701 |
11 | 20164522955 |
12 | a15246b505 |
13 | 4c01682c62 |
14 | 27547c9d53 |
15 | 1558e3b4bb |
hex | c28334315 |
52214055701 has 8 divisors (see below), whose sum is σ = 53081876544. Its totient is φ = 51350358240.
The previous prime is 52214055689. The next prime is 52214055713. The reversal of 52214055701 is 10755041225.
It is an interprime number because it is at equal distance from previous prime (52214055689) and next prime (52214055713).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-52214055701 is a prime.
It is a super-2 number, since 2×522140557012 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52214055721) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1005305 + ... + 1055966.
It is an arithmetic number, because the mean of its divisors is an integer number (6635234568).
Almost surely, 252214055701 is an apocalyptic number.
It is an amenable number.
52214055701 is a deficient number, since it is larger than the sum of its proper divisors (867820843).
52214055701 is a wasteful number, since it uses less digits than its factorization.
52214055701 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2061691.
The product of its (nonzero) digits is 14000, while the sum is 32.
Adding to 52214055701 its reverse (10755041225), we get a palindrome (62969096926).
The spelling of 52214055701 in words is "fifty-two billion, two hundred fourteen million, fifty-five thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •