Base | Representation |
---|---|
bin | 111101011110010000… |
… | …1111100101111011001 |
3 | 110121202010221012210212 |
4 | 1322330201330233121 |
5 | 4130330040110113 |
6 | 140351232020505 |
7 | 12352244532464 |
oct | 1727441745731 |
9 | 417663835725 |
10 | 132012035033 |
11 | 50a933968aa |
12 | 21702691735 |
13 | c5aa9a3ac8 |
14 | 65647b82db |
15 | 36798020a8 |
hex | 1ebc87cbd9 |
132012035033 has 8 divisors (see below), whose sum is σ = 136290771456. Its totient is φ = 127734566400.
The previous prime is 132012035003. The next prime is 132012035081. The reversal of 132012035033 is 330530210231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 132012035033 - 218 = 132011772889 is a prime.
It is a super-2 number, since 2×1320120350332 (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 (132012035003) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 103016 + ... + 524057.
It is an arithmetic number, because the mean of its divisors is an integer number (17036346432).
Almost surely, 2132012035033 is an apocalyptic number.
It is an amenable number.
132012035033 is a deficient number, since it is larger than the sum of its proper divisors (4278736423).
132012035033 is an equidigital number, since it uses as much as digits as its factorization.
132012035033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 633895.
The product of its (nonzero) digits is 1620, while the sum is 23.
Adding to 132012035033 its reverse (330530210231), we get a palindrome (462542245264).
The spelling of 132012035033 in words is "one hundred thirty-two billion, twelve million, thirty-five thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •