Base | Representation |
---|---|
bin | 111101100011111001… |
… | …0110101111110001010 |
3 | 110122020022112022000122 |
4 | 1323013302311332022 |
5 | 4131221424410010 |
6 | 140422102303242 |
7 | 12360031033154 |
oct | 1730762657612 |
9 | 418208468018 |
10 | 132201013130 |
11 | 5108003094a |
12 | 21755a27b22 |
13 | c60ab9c374 |
14 | 658192bad4 |
15 | 368b1d0855 |
hex | 1ec7cb5f8a |
132201013130 has 8 divisors (see below), whose sum is σ = 237961823652. Its totient is φ = 52880405248.
The previous prime is 132201013129. The next prime is 132201013169. The reversal of 132201013130 is 31310102231.
It can be written as a sum of positive squares in 2 ways, for example, as 110796445321 + 21404567809 = 332861^2 + 146303^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 132201013099 and 132201013108.
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 3 ways as a sum of consecutive naturals, for example, 6610050647 + ... + 6610050666.
Almost surely, 2132201013130 is an apocalyptic number.
132201013130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132201013130 is a deficient number, since it is larger than the sum of its proper divisors (105760810522).
132201013130 is a wasteful number, since it uses less digits than its factorization.
132201013130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13220101320.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 132201013130 its reverse (31310102231), we get a palindrome (163511115361).
The spelling of 132201013130 in words is "one hundred thirty-two billion, two hundred one million, thirteen thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •