Base | Representation |
---|---|
bin | 111101011110010010… |
… | …1101101001111001110 |
3 | 110121202012210021002012 |
4 | 1322330211231033032 |
5 | 4130330313120420 |
6 | 140351305101222 |
7 | 12352256104436 |
oct | 1727445551716 |
9 | 417665707065 |
10 | 132013020110 |
11 | 50a939a9a14 |
12 | 21702a87812 |
13 | c5aac5a2aa |
14 | 65649932c6 |
15 | 3679948dc5 |
hex | 1ebc96d3ce |
132013020110 has 64 divisors (see below), whose sum is σ = 251614771200. Its totient is φ = 49729946112.
The previous prime is 132013020109. The next prime is 132013020143. The reversal of 132013020110 is 11020310231.
132013020110 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 22983899 + ... + 22989641.
It is an arithmetic number, because the mean of its divisors is an integer number (3931480800).
Almost surely, 2132013020110 is an apocalyptic number.
132013020110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132013020110 is a deficient number, since it is larger than the sum of its proper divisors (119601751090).
132013020110 is a wasteful number, since it uses less digits than its factorization.
132013020110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6465.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 132013020110 its reverse (11020310231), we get a palindrome (143033330341).
The spelling of 132013020110 in words is "one hundred thirty-two billion, thirteen million, twenty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •