Base | Representation |
---|---|
bin | 111101100000111100… |
… | …1100100100000100001 |
3 | 110121222102102122222110 |
4 | 1323001321210200201 |
5 | 4131021120111223 |
6 | 140404210425533 |
7 | 12354420302412 |
oct | 1730171444041 |
9 | 417872378873 |
10 | 132102113313 |
11 | 5102a220a65 |
12 | 217288922a9 |
13 | c5c3552571 |
14 | 6572745809 |
15 | 3682696d93 |
hex | 1ec1e64821 |
132102113313 has 8 divisors (see below), whose sum is σ = 176544821376. Its totient is φ = 87863740400.
The previous prime is 132102113303. The next prime is 132102113357. The reversal of 132102113313 is 313311201231.
It is a happy number.
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 132102113313 - 217 = 132101982241 is a prime.
It is a super-3 number, since 3×1321021133133 (a number of 34 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 132102113313.
It is not an unprimeable number, because it can be changed into a prime (132102113303) 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, 51082278 + ... + 51084863.
It is an arithmetic number, because the mean of its divisors is an integer number (22068102672).
Almost surely, 2132102113313 is an apocalyptic number.
It is an amenable number.
132102113313 is a deficient number, since it is larger than the sum of its proper divisors (44442708063).
132102113313 is a wasteful number, since it uses less digits than its factorization.
132102113313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 102167575.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 132102113313 its reverse (313311201231), we get a palindrome (445413314544).
The spelling of 132102113313 in words is "one hundred thirty-two billion, one hundred two million, one hundred thirteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •