Base | Representation |
---|---|
bin | 11110000101001111001101… |
… | …010011011001001110001101 |
3 | 122100102212211121102100110122 |
4 | 132011033031103121032031 |
5 | 114320111101420011023 |
6 | 1145214215511514325 |
7 | 36603312044214011 |
oct | 3605171523311615 |
9 | 570385747370418 |
10 | 132301322032013 |
11 | 39178748220552 |
12 | 12a08a710889a5 |
13 | 58a8c657c8404 |
14 | 24955bd5a8541 |
15 | 10466dad282c8 |
hex | 7853cd4d938d |
132301322032013 has 16 divisors (see below), whose sum is σ = 134024650218816. Its totient is φ = 130581129127680.
The previous prime is 132301322032007. The next prime is 132301322032037. The reversal of 132301322032013 is 310230223103231.
It is a cyclic number.
It is not a de Polignac number, because 132301322032013 - 216 = 132301321966477 is a prime.
It is a super-2 number, since 2×1323013220320132 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132301322037013) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 393641045 + ... + 393976997.
It is an arithmetic number, because the mean of its divisors is an integer number (8376540638676).
Almost surely, 2132301322032013 is an apocalyptic number.
It is an amenable number.
132301322032013 is a deficient number, since it is larger than the sum of its proper divisors (1723328186803).
132301322032013 is a wasteful number, since it uses less digits than its factorization.
132301322032013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 340604.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 132301322032013 its reverse (310230223103231), we get a palindrome (442531545135244).
The spelling of 132301322032013 in words is "one hundred thirty-two trillion, three hundred one billion, three hundred twenty-two million, thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •