Base | Representation |
---|---|
bin | 111101100001100001… |
… | …0110001010011000101 |
3 | 110122000202112120012110 |
4 | 1323003002301103011 |
5 | 4131041023132323 |
6 | 140410134011233 |
7 | 12355042352625 |
oct | 1730302612305 |
9 | 418022476173 |
10 | 132121302213 |
11 | 5103a03795a |
12 | 217331a6b19 |
13 | c5c7510744 |
14 | 65750dc885 |
15 | 36841d7793 |
hex | 1ec30b14c5 |
132121302213 has 12 divisors (see below), whose sum is σ = 178419883488. Its totient is φ = 86965908120.
The previous prime is 132121302163. The next prime is 132121302241. The reversal of 132121302213 is 312203121231.
It is not a de Polignac number, because 132121302213 - 26 = 132121302149 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 132121302213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132121302013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3509593 + ... + 3547038.
It is an arithmetic number, because the mean of its divisors is an integer number (14868323624).
Almost surely, 2132121302213 is an apocalyptic number.
It is an amenable number.
132121302213 is a deficient number, since it is larger than the sum of its proper divisors (46298581275).
132121302213 is an frugal number, since it uses more digits than its factorization.
132121302213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7056792 (or 7056713 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 132121302213 its reverse (312203121231), we get a palindrome (444324423444).
The spelling of 132121302213 in words is "one hundred thirty-two billion, one hundred twenty-one million, three hundred two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •