Base | Representation |
---|---|
bin | 10100111100010100000110… |
… | …11101001110110010100011 |
3 | 20001001121102221022212010201 |
4 | 22132022003131032302203 |
5 | 22014012211233411023 |
6 | 241540215043210031 |
7 | 12462131266133266 |
oct | 1236120335166243 |
9 | 201047387285121 |
10 | 46052844825763 |
11 | 137459a1344246 |
12 | 51b9424676917 |
13 | 1c909c2b8a719 |
14 | b52d8076acdd |
15 | 54ce1818abad |
hex | 29e28374eca3 |
46052844825763 has 2 divisors, whose sum is σ = 46052844825764. Its totient is φ = 46052844825762.
The previous prime is 46052844825727. The next prime is 46052844825791. The reversal of 46052844825763 is 36752844825064.
46052844825763 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 46052844825763 - 221 = 46052842728611 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 46052844825695 and 46052844825704.
It is not a weakly prime, because it can be changed into another prime (46052844835763) 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 as a sum of consecutive naturals, namely, 23026422412881 + 23026422412882.
It is an arithmetic number, because the mean of its divisors is an integer number (23026422412882).
Almost surely, 246052844825763 is an apocalyptic number.
46052844825763 is a deficient number, since it is larger than the sum of its proper divisors (1).
46052844825763 is an equidigital number, since it uses as much as digits as its factorization.
46052844825763 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 309657600, while the sum is 64.
The spelling of 46052844825763 in words is "forty-six trillion, fifty-two billion, eight hundred forty-four million, eight hundred twenty-five thousand, seven hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •