Base | Representation |
---|---|
bin | 11000001010111010000001… |
… | …00110001010001101111110 |
3 | 20222012012210202122210122121 |
4 | 30011131000212022031332 |
5 | 23431312332313030100 |
6 | 305013212203233154 |
7 | 14124024601635331 |
oct | 1405350046121576 |
9 | 228165722583577 |
10 | 53151304033150 |
11 | 15a32383525364 |
12 | 5b650b42187ba |
13 | 23871b9a1cc7b |
14 | d1a773142618 |
15 | 6228c26bd51a |
hex | 30574098a37e |
53151304033150 has 48 divisors (see below), whose sum is σ = 102308339682000. Its totient is φ = 20519793109760.
The previous prime is 53151304033129. The next prime is 53151304033151. The reversal of 53151304033150 is 5133040315135.
It is a happy number.
It is a super-2 number, since 2×531513040331502 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53151304033151) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2877127 + ... + 10704226.
It is an arithmetic number, because the mean of its divisors is an integer number (2131423743375).
Almost surely, 253151304033150 is an apocalyptic number.
53151304033150 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
53151304033150 is a deficient number, since it is larger than the sum of its proper divisors (49157035648850).
53151304033150 is a wasteful number, since it uses less digits than its factorization.
53151304033150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13584093 (or 13584088 counting only the distinct ones).
The product of its (nonzero) digits is 40500, while the sum is 34.
Adding to 53151304033150 its reverse (5133040315135), we get a palindrome (58284344348285).
The spelling of 53151304033150 in words is "fifty-three trillion, one hundred fifty-one billion, three hundred four million, thirty-three thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •