Base | Representation |
---|---|
bin | 10111101100101011000001… |
… | …01110100100000111011001 |
3 | 20211111220101000020221112021 |
4 | 23312111200232210013121 |
5 | 23312302310010143112 |
6 | 302500044544214441 |
7 | 13656000236013661 |
oct | 1366254056440731 |
9 | 224456330227467 |
10 | 52112461021657 |
11 | 1567185274aa83 |
12 | 5a178b190a421 |
13 | 23102512b6b7a |
14 | cc23840631a1 |
15 | 605870d11907 |
hex | 2f6560ba41d9 |
52112461021657 has 16 divisors (see below), whose sum is σ = 54911523880000. Its totient is φ = 49319053827264.
The previous prime is 52112461021637. The next prime is 52112461021763. The reversal of 52112461021657 is 75612016421125.
It is a happy number.
52112461021657 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 52112461021657 - 223 = 52112452633049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (52112461021637) 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, 73668319 + ... + 74372347.
It is an arithmetic number, because the mean of its divisors is an integer number (3431970242500).
Almost surely, 252112461021657 is an apocalyptic number.
It is an amenable number.
52112461021657 is a deficient number, since it is larger than the sum of its proper divisors (2799062858343).
52112461021657 is a wasteful number, since it uses less digits than its factorization.
52112461021657 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 708040.
The product of its (nonzero) digits is 201600, while the sum is 43.
The spelling of 52112461021657 in words is "fifty-two trillion, one hundred twelve billion, four hundred sixty-one million, twenty-one thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.208 sec. • engine limits •