Base | Representation |
---|---|
bin | 10111110000011111000001… |
… | …00001010010101111100001 |
3 | 20211222102111010202000022002 |
4 | 23320033200201102233201 |
5 | 23321424043213421103 |
6 | 303040151135253345 |
7 | 14001315331234400 |
oct | 1370174041225741 |
9 | 224872433660262 |
10 | 52243454045153 |
11 | 15712362908388 |
12 | 5a3916b07a255 |
13 | 231c6c8b25267 |
14 | cc884d381637 |
15 | 608e8ae29488 |
hex | 2f83e0852be1 |
52243454045153 has 12 divisors (see below), whose sum is σ = 60831489438720. Its totient is φ = 44737004190312.
The previous prime is 52243454045099. The next prime is 52243454045171. The reversal of 52243454045153 is 35154045434225.
It is not a de Polignac number, because 52243454045153 - 26 = 52243454045089 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 52243454045098 and 52243454045107.
It is not an unprimeable number, because it can be changed into a prime (52243454045953) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 513035201 + ... + 513137022.
It is an arithmetic number, because the mean of its divisors is an integer number (5069290786560).
Almost surely, 252243454045153 is an apocalyptic number.
It is an amenable number.
52243454045153 is a deficient number, since it is larger than the sum of its proper divisors (8588035393567).
52243454045153 is a wasteful number, since it uses less digits than its factorization.
52243454045153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1026173276 (or 1026173269 counting only the distinct ones).
The product of its (nonzero) digits is 5760000, while the sum is 47.
Adding to 52243454045153 its reverse (35154045434225), we get a palindrome (87397499479378).
The spelling of 52243454045153 in words is "fifty-two trillion, two hundred forty-three billion, four hundred fifty-four million, forty-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •