Base | Representation |
---|---|
bin | 11110000011111110011111… |
… | …111110000101001000000001 |
3 | 122100010121011010111220020011 |
4 | 132003332133332011020001 |
5 | 114312201112000432113 |
6 | 1145110324405144521 |
7 | 36564123403153036 |
oct | 3603763776051001 |
9 | 570117133456204 |
10 | 132214662124033 |
11 | 39144a17a37a95 |
12 | 129b41069bb141 |
13 | 58a0a34984b58 |
14 | 249131c12138d |
15 | 1044317d1d63d |
hex | 783f9ff85201 |
132214662124033 has 4 divisors (see below), whose sum is σ = 132264876582468. Its totient is φ = 132164447665600.
The previous prime is 132214662123959. The next prime is 132214662124189. The reversal of 132214662124033 is 330421266412231.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 7446387643249 + 124768274480784 = 2728807^2 + 11169972^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132214662124033 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132214662124933) 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, 25107225268 + ... + 25107230533.
It is an arithmetic number, because the mean of its divisors is an integer number (33066219145617).
Almost surely, 2132214662124033 is an apocalyptic number.
It is an amenable number.
132214662124033 is a deficient number, since it is larger than the sum of its proper divisors (50214458435).
132214662124033 is an equidigital number, since it uses as much as digits as its factorization.
132214662124033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50214458434.
The product of its (nonzero) digits is 248832, while the sum is 40.
The spelling of 132214662124033 in words is "one hundred thirty-two trillion, two hundred fourteen billion, six hundred sixty-two million, one hundred twenty-four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •