Base | Representation |
---|---|
bin | 11000001010010110110101… |
… | …01110010011110011001100 |
3 | 20222010102001100122201210102 |
4 | 30011023122232103303030 |
5 | 23431010141221234312 |
6 | 305000410002230232 |
7 | 14122455530002640 |
oct | 1405133256236314 |
9 | 228112040581712 |
10 | 53132415024332 |
11 | 15a25370138476 |
12 | 5b61502355378 |
13 | 2385499573a87 |
14 | d198a061ac20 |
15 | 622169259ec2 |
hex | 3052dab93ccc |
53132415024332 has 24 divisors (see below), whose sum is σ = 106286565816480. Its totient is φ = 22766377345920.
The previous prime is 53132415024287. The next prime is 53132415024397. The reversal of 53132415024332 is 23342051423135.
53132415024332 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 7 ways as a sum of consecutive naturals, for example, 193930019 + ... + 194203802.
It is an arithmetic number, because the mean of its divisors is an integer number (4428606909020).
Almost surely, 253132415024332 is an apocalyptic number.
It is an amenable number.
53132415024332 is an abundant number, since it is smaller than the sum of its proper divisors (53154150792148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53132415024332 is a wasteful number, since it uses less digits than its factorization.
53132415024332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 388138721 (or 388138719 counting only the distinct ones).
The product of its (nonzero) digits is 259200, while the sum is 38.
Adding to 53132415024332 its reverse (23342051423135), we get a palindrome (76474466447467).
The spelling of 53132415024332 in words is "fifty-three trillion, one hundred thirty-two billion, four hundred fifteen million, twenty-four thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •