Base | Representation |
---|---|
bin | 10111101010000011111001… |
… | …00111100011000110111001 |
3 | 20211012022202211020001100101 |
4 | 23311001330213203012321 |
5 | 23304320030031200403 |
6 | 302350525300235401 |
7 | 13646342601204223 |
oct | 1365017447430671 |
9 | 224168684201311 |
10 | 52022734631353 |
11 | 15637799518a02 |
12 | 5a0243069bb61 |
13 | 2304952082725 |
14 | cbbcb1629413 |
15 | 60336d9ce71d |
hex | 2f507c9e31b9 |
52022734631353 has 8 divisors (see below), whose sum is σ = 52037141518656. Its totient is φ = 52008328218000.
The previous prime is 52022734631279. The next prime is 52022734631437. The reversal of 52022734631353 is 35313643722025.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 52022734631353 - 217 = 52022734500281 is a prime.
It is a super-3 number, since 3×520227346313533 (a number of 42 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (52022734631053) 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, 414847900 + ... + 414973282.
It is an arithmetic number, because the mean of its divisors is an integer number (6504642689832).
Almost surely, 252022734631353 is an apocalyptic number.
It is an amenable number.
52022734631353 is a deficient number, since it is larger than the sum of its proper divisors (14406887303).
52022734631353 is a wasteful number, since it uses less digits than its factorization.
52022734631353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 236975.
The product of its (nonzero) digits is 2721600, while the sum is 46.
The spelling of 52022734631353 in words is "fifty-two trillion, twenty-two billion, seven hundred thirty-four million, six hundred thirty-one thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •