Base | Representation |
---|---|
bin | 110001011101010010… |
… | …011101100010100111 |
3 | 12002001221220201002100 |
4 | 301131102131202213 |
5 | 1332224302300411 |
6 | 40221310343143 |
7 | 3556661512362 |
oct | 613522354247 |
9 | 162057821070 |
10 | 53104728231 |
11 | 20581264355 |
12 | a3607baab3 |
13 | 5014061c19 |
14 | 27dabd90d9 |
15 | 15ac224456 |
hex | c5d49d8a7 |
53104728231 has 24 divisors (see below), whose sum is σ = 81688510800. Its totient is φ = 33127992576.
The previous prime is 53104728217. The next prime is 53104728253. The reversal of 53104728231 is 13282740135.
53104728231 is a `hidden beast` number, since 531 + 0 + 47 + 2 + 82 + 3 + 1 = 666.
It is not a de Polignac number, because 53104728231 - 29 = 53104727719 is a prime.
It is a super-2 number, since 2×531047282312 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53104728331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 976681 + ... + 1029618.
It is an arithmetic number, because the mean of its divisors is an integer number (3403687950).
Almost surely, 253104728231 is an apocalyptic number.
53104728231 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
53104728231 is a deficient number, since it is larger than the sum of its proper divisors (28583782569).
53104728231 is a wasteful number, since it uses less digits than its factorization.
53104728231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2006495 (or 2006492 counting only the distinct ones).
The product of its (nonzero) digits is 40320, while the sum is 36.
The spelling of 53104728231 in words is "fifty-three billion, one hundred four million, seven hundred twenty-eight thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •