Base | Representation |
---|---|
bin | 101100100111100001110… |
… | …1011001101010010100100 |
3 | 210201020021122110010000201 |
4 | 1121033003223031102210 |
5 | 1300432222002341030 |
6 | 21013032213520244 |
7 | 1202015443205320 |
oct | 131170353152244 |
9 | 23636248403021 |
10 | 6132201215140 |
11 | 1a547197a1050 |
12 | 830565943084 |
13 | 3563582a00a0 |
14 | 172b2b770980 |
15 | a97a51a82ca |
hex | 593c3acd4a4 |
6132201215140 has 96 divisors (see below), whose sum is σ = 17290234531584. Its totient is φ = 1764309634560.
The previous prime is 6132201215131. The next prime is 6132201215143. The reversal of 6132201215140 is 415121022316.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a junction number, because it is equal to n+sod(n) for n = 6132201215099 and 6132201215108.
It is not an unprimeable number, because it can be changed into a prime (6132201215143) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 153131859 + ... + 153171898.
It is an arithmetic number, because the mean of its divisors is an integer number (180106609704).
Almost surely, 26132201215140 is an apocalyptic number.
It is an amenable number.
6132201215140 is an abundant number, since it is smaller than the sum of its proper divisors (11158033316444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6132201215140 is a wasteful number, since it uses less digits than its factorization.
6132201215140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 306303797 (or 306303795 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 28.
Adding to 6132201215140 its reverse (415121022316), we get a palindrome (6547322237456).
The spelling of 6132201215140 in words is "six trillion, one hundred thirty-two billion, two hundred one million, two hundred fifteen thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •