Base | Representation |
---|---|
bin | 11110000011110000111101… |
… | …001101110100010001001011 |
3 | 122100002012121200200221010101 |
4 | 132003300331031310101023 |
5 | 114311431321310344034 |
6 | 1145055521421430231 |
7 | 36563100136443664 |
oct | 3603607515642113 |
9 | 570065550627111 |
10 | 132200120403019 |
11 | 39139835576839 |
12 | 129b1328a0b377 |
13 | 589c558073bc6 |
14 | 249073cb1236b |
15 | 1043c66380514 |
hex | 783c3d37444b |
132200120403019 has 4 divisors (see below), whose sum is σ = 132233063372496. Its totient is φ = 132167177433544.
The previous prime is 132200120402993. The next prime is 132200120403037. The reversal of 132200120403019 is 910304021002231.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 132200120403019 - 213 = 132200120394827 is a prime.
It is a super-3 number, since 3×1322001204030193 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132200120403059) 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, 16471478719 + ... + 16471486744.
It is an arithmetic number, because the mean of its divisors is an integer number (33058265843124).
Almost surely, 2132200120403019 is an apocalyptic number.
132200120403019 is a deficient number, since it is larger than the sum of its proper divisors (32942969477).
132200120403019 is an equidigital number, since it uses as much as digits as its factorization.
132200120403019 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32942969476.
The product of its (nonzero) digits is 2592, while the sum is 28.
The spelling of 132200120403019 in words is "one hundred thirty-two trillion, two hundred billion, one hundred twenty million, four hundred three thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •