Base | Representation |
---|---|
bin | 111101011110001101… |
… | …0010001110001000011 |
3 | 110121202000011001012021 |
4 | 1322330122101301003 |
5 | 4130324031232003 |
6 | 140351120542311 |
7 | 12352221455434 |
oct | 1727432216103 |
9 | 417660131167 |
10 | 132010024003 |
11 | 50a922429a0 |
12 | 21701a81997 |
13 | c5aa44b650 |
14 | 656441348b |
15 | 36795562bd |
hex | 1ebc691c43 |
132010024003 has 32 divisors (see below), whose sum is σ = 165778970112. Its totient is φ = 103376697600.
The previous prime is 132010023983. The next prime is 132010024007. The reversal of 132010024003 is 300420010231.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-132010024003 is a prime.
It is a super-2 number, since 2×1320100240032 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132010024007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 354625 + ... + 624322.
It is an arithmetic number, because the mean of its divisors is an integer number (5180592816).
Almost surely, 2132010024003 is an apocalyptic number.
132010024003 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
132010024003 is a deficient number, since it is larger than the sum of its proper divisors (33768946109).
132010024003 is a wasteful number, since it uses less digits than its factorization.
132010024003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 979035.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 132010024003 its reverse (300420010231), we get a palindrome (432430034234).
The spelling of 132010024003 in words is "one hundred thirty-two billion, ten million, twenty-four thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •