Base | Representation |
---|---|
bin | 11110000001010111010111… |
… | …111010001111001000110101 |
3 | 122022111102221221110210101111 |
4 | 132001113113322033020311 |
5 | 114301231103233423013 |
6 | 1144452050010355021 |
7 | 36545141432326051 |
oct | 3601272772171065 |
9 | 568442857423344 |
10 | 132035212014133 |
11 | 3908590103843a |
12 | 1298538542ba71 |
13 | 5889b36c42a7c |
14 | 2486777386c61 |
15 | 103e813a3573d |
hex | 7815d7e8f235 |
132035212014133 has 16 divisors (see below), whose sum is σ = 134824418113536. Its totient is φ = 129257072904960.
The previous prime is 132035212014103. The next prime is 132035212014149. The reversal of 132035212014133 is 331410212530231.
It is not a de Polignac number, because 132035212014133 - 229 = 132034675143221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132035212014095 and 132035212014104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132035212014103) 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, 476924316 + ... + 477201082.
It is an arithmetic number, because the mean of its divisors is an integer number (8426526132096).
Almost surely, 2132035212014133 is an apocalyptic number.
It is an amenable number.
132035212014133 is a deficient number, since it is larger than the sum of its proper divisors (2789206099403).
132035212014133 is a wasteful number, since it uses less digits than its factorization.
132035212014133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 296724.
The product of its (nonzero) digits is 12960, while the sum is 31.
Adding to 132035212014133 its reverse (331410212530231), we get a palindrome (463445424544364).
The spelling of 132035212014133 in words is "one hundred thirty-two trillion, thirty-five billion, two hundred twelve million, fourteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •