Base | Representation |
---|---|
bin | 111101100001011111… |
… | …0001110110110010010 |
3 | 110122000200022010021010 |
4 | 1323002332032312102 |
5 | 4131040222100110 |
6 | 140410052311350 |
7 | 12355026266310 |
oct | 1730276166622 |
9 | 418020263233 |
10 | 132120112530 |
11 | 510393a504a |
12 | 21732912556 |
13 | c5c71b50a3 |
14 | 6574cad0b0 |
15 | 3684050020 |
hex | 1ec2f8ed92 |
132120112530 has 32 divisors (see below), whose sum is σ = 362386594944. Its totient is φ = 30198882816.
The previous prime is 132120112493. The next prime is 132120112571. The reversal of 132120112530 is 35211021231.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 132120112497 and 132120112506.
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, 314571487 + ... + 314571906.
It is an arithmetic number, because the mean of its divisors is an integer number (11324581092).
Almost surely, 2132120112530 is an apocalyptic number.
132120112530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132120112530 is an abundant number, since it is smaller than the sum of its proper divisors (230266482414).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132120112530 is a wasteful number, since it uses less digits than its factorization.
132120112530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 629143410.
The product of its (nonzero) digits is 360, while the sum is 21.
Adding to 132120112530 its reverse (35211021231), we get a palindrome (167331133761).
It can be divided in two parts, 132120 and 112530, that added together give a triangular number (244650 = T699).
The spelling of 132120112530 in words is "one hundred thirty-two billion, one hundred twenty million, one hundred twelve thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •