Base | Representation |
---|---|
bin | 110001110111001111… |
… | …111001110100011110 |
3 | 12010012022110021112220 |
4 | 301313033321310132 |
5 | 1334122301441441 |
6 | 40332425410210 |
7 | 3603530513526 |
oct | 616717716436 |
9 | 163168407486 |
10 | 53540265246 |
11 | 207850a17a6 |
12 | a462639966 |
13 | 5083366830 |
14 | 283c9b0686 |
15 | 15d55a7466 |
hex | c773f9d1e |
53540265246 has 128 divisors (see below), whose sum is σ = 118652688000. Its totient is φ = 16006864896.
The previous prime is 53540265227. The next prime is 53540265313. The reversal of 53540265246 is 64256204535.
It is a super-2 number, since 2×535402652462 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 53540265198 and 53540265207.
It is a congruent number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 130905090 + ... + 130905498.
It is an arithmetic number, because the mean of its divisors is an integer number (926974125).
Almost surely, 253540265246 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 53540265246, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (59326344000).
53540265246 is an abundant number, since it is smaller than the sum of its proper divisors (65112422754).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53540265246 is a wasteful number, since it uses less digits than its factorization.
53540265246 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 798.
The product of its (nonzero) digits is 864000, while the sum is 42.
The spelling of 53540265246 in words is "fifty-three billion, five hundred forty million, two hundred sixty-five thousand, two hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •