Base | Representation |
---|---|
bin | 110001110100011000… |
… | …111001100100001101 |
3 | 12010001222011222102120 |
4 | 301310120321210031 |
5 | 1334023011314403 |
6 | 40323553243153 |
7 | 3602405656440 |
oct | 616430714415 |
9 | 163058158376 |
10 | 53492291853 |
11 | 20760005670 |
12 | a44a5634b9 |
13 | 507643aa00 |
14 | 2836483657 |
15 | 15d127ce53 |
hex | c7463990d |
53492291853 has 48 divisors (see below), whose sum is σ = 96288662016. Its totient is φ = 25650630720.
The previous prime is 53492291849. The next prime is 53492291863. The reversal of 53492291853 is 35819229435.
It is a happy number.
It is not a de Polignac number, because 53492291853 - 22 = 53492291849 is a prime.
It is a super-2 number, since 2×534922918532 (a number of 22 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 53492291796 and 53492291805.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53492291803) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 646075 + ... + 724152.
It is an arithmetic number, because the mean of its divisors is an integer number (2006013792).
Almost surely, 253492291853 is an apocalyptic number.
It is an amenable number.
53492291853 is a deficient number, since it is larger than the sum of its proper divisors (42796370163).
53492291853 is a wasteful number, since it uses less digits than its factorization.
53492291853 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1370274 (or 1370261 counting only the distinct ones).
The product of its digits is 2332800, while the sum is 51.
The spelling of 53492291853 in words is "fifty-three billion, four hundred ninety-two million, two hundred ninety-one thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •