Base | Representation |
---|---|
bin | 111101100000111101… |
… | …0101101001111100001 |
3 | 110121222102222210122112 |
4 | 1323001322231033201 |
5 | 4131021204124413 |
6 | 140404221045105 |
7 | 12354422653112 |
oct | 1730172551741 |
9 | 417872883575 |
10 | 132102411233 |
11 | 5102a404881 |
12 | 217289b6795 |
13 | c5c3628050 |
14 | 65727c2209 |
15 | 36827052a8 |
hex | 1ec1ead3e1 |
132102411233 has 8 divisors (see below), whose sum is σ = 142272922176. Its totient is φ = 121933155600.
The previous prime is 132102411227. The next prime is 132102411263. The reversal of 132102411233 is 332114201231.
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 132102411233 - 214 = 132102394849 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132102411199 and 132102411208.
It is not an unprimeable number, because it can be changed into a prime (132102411223) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 89303 + ... + 521708.
It is an arithmetic number, because the mean of its divisors is an integer number (17784115272).
Almost surely, 2132102411233 is an apocalyptic number.
132102411233 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
132102411233 is a deficient number, since it is larger than the sum of its proper divisors (10170510943).
132102411233 is a wasteful number, since it uses less digits than its factorization.
132102411233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 627655.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 132102411233 its reverse (332114201231), we get a palindrome (464216612464).
The spelling of 132102411233 in words is "one hundred thirty-two billion, one hundred two million, four hundred eleven thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •