Base | Representation |
---|---|
bin | 11110000001010111001110… |
… | …010001011000101001011001 |
3 | 122022111102112200012101100011 |
4 | 132001113032101120221121 |
5 | 114301230240334411413 |
6 | 1144452021552441521 |
7 | 36545134430012110 |
oct | 3601271621305131 |
9 | 568442480171304 |
10 | 132035050310233 |
11 | 39085828831954 |
12 | 1298533b2492a1 |
13 | 5889b0c5a68a5 |
14 | 248675dad2c77 |
15 | 103e80474333d |
hex | 7815ce458a59 |
132035050310233 has 4 divisors (see below), whose sum is σ = 150897200354560. Its totient is φ = 113172900265908.
The previous prime is 132035050310231. The next prime is 132035050310257. The reversal of 132035050310233 is 332013050530231.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 132035050310233 - 21 = 132035050310231 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132035050310195 and 132035050310204.
It is not an unprimeable number, because it can be changed into a prime (132035050310231) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9431075022153 + ... + 9431075022166.
It is an arithmetic number, because the mean of its divisors is an integer number (37724300088640).
Almost surely, 2132035050310233 is an apocalyptic number.
It is an amenable number.
132035050310233 is a deficient number, since it is larger than the sum of its proper divisors (18862150044327).
132035050310233 is an equidigital number, since it uses as much as digits as its factorization.
132035050310233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18862150044326.
The product of its (nonzero) digits is 24300, while the sum is 31.
The spelling of 132035050310233 in words is "one hundred thirty-two trillion, thirty-five billion, fifty million, three hundred ten thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •