Base | Representation |
---|---|
bin | 11111000001110111000… |
… | …010111010101010111000 |
3 | 21112211211201120122020202 |
4 | 133001313002322222320 |
5 | 234413423031011440 |
6 | 4311322055141332 |
7 | 310024256502620 |
oct | 37016702725270 |
9 | 7484751518222 |
10 | 2132301032120 |
11 | 752338386456 |
12 | 2a5307374848 |
13 | 1260c9082a6c |
14 | 752bd7b5880 |
15 | 3a6ecd68615 |
hex | 1f0770baab8 |
2132301032120 has 64 divisors (see below), whose sum is σ = 5483231236800. Its totient is φ = 731051781120.
The previous prime is 2132301032101. The next prime is 2132301032137. The reversal of 2132301032120 is 212301032312.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 2132301032092 and 2132301032101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10559300 + ... + 10759340.
It is an arithmetic number, because the mean of its divisors is an integer number (85675488075).
Almost surely, 22132301032120 is an apocalyptic number.
2132301032120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2132301032120 is an abundant number, since it is smaller than the sum of its proper divisors (3350930204680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2132301032120 is a wasteful number, since it uses less digits than its factorization.
2132301032120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 238128 (or 238124 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 2132301032120 its reverse (212301032312), we get a palindrome (2344602064432).
The spelling of 2132301032120 in words is "two trillion, one hundred thirty-two billion, three hundred one million, thirty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •