Base | Representation |
---|---|
bin | 110001011101000110… |
… | …001100011010011111 |
3 | 12002001201212022201200 |
4 | 301131012030122133 |
5 | 1332222441343401 |
6 | 40221113410543 |
7 | 3556622256546 |
oct | 613506143237 |
9 | 162051768650 |
10 | 53101512351 |
11 | 2057a4681a8 |
12 | a35b709a53 |
13 | 50134a7234 |
14 | 27da5dd15d |
15 | 15abcdb686 |
hex | c5d18c69f |
53101512351 has 12 divisors (see below), whose sum is σ = 76711167312. Its totient is φ = 35396862336.
The previous prime is 53101512319. The next prime is 53101512371. The reversal of 53101512351 is 15321510135.
53101512351 is a `hidden beast` number, since 531 + 0 + 1 + 5 + 123 + 5 + 1 = 666.
It is not a de Polignac number, because 53101512351 - 25 = 53101512319 is a prime.
It is a super-2 number, since 2×531015123512 (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 (53101512311) 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 11 ways as a sum of consecutive naturals, for example, 263346 + ... + 418991.
It is an arithmetic number, because the mean of its divisors is an integer number (6392597276).
Almost surely, 253101512351 is an apocalyptic number.
53101512351 is a deficient number, since it is larger than the sum of its proper divisors (23609654961).
53101512351 is a wasteful number, since it uses less digits than its factorization.
53101512351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 690990 (or 690987 counting only the distinct ones).
The product of its (nonzero) digits is 2250, while the sum is 27.
The spelling of 53101512351 in words is "fifty-three billion, one hundred one million, five hundred twelve thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •