Base | Representation |
---|---|
bin | 11110000001001001010011… |
… | …111000101110010101000001 |
3 | 122022102222222121100212002210 |
4 | 132001021103320232111001 |
5 | 114301004142200420301 |
6 | 1144441111403332333 |
7 | 36544065310350321 |
oct | 3601112370562501 |
9 | 568388877325083 |
10 | 132020112123201 |
11 | 3907a462599935 |
12 | 129824705210a9 |
13 | 588859b7c0a73 |
14 | 2485b43b9d281 |
15 | 103e22d08dad6 |
hex | 781253e2e541 |
132020112123201 has 4 divisors (see below), whose sum is σ = 176026816164272. Its totient is φ = 88013408082132.
The previous prime is 132020112123181. The next prime is 132020112123203. The reversal of 132020112123201 is 102321211020231.
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 132020112123201 - 211 = 132020112121153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132020112123203) 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, 22003352020531 + ... + 22003352020536.
It is an arithmetic number, because the mean of its divisors is an integer number (44006704041068).
Almost surely, 2132020112123201 is an apocalyptic number.
It is an amenable number.
132020112123201 is a deficient number, since it is larger than the sum of its proper divisors (44006704041071).
132020112123201 is an equidigital number, since it uses as much as digits as its factorization.
132020112123201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44006704041070.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 132020112123201 its reverse (102321211020231), we get a palindrome (234341323143432).
The spelling of 132020112123201 in words is "one hundred thirty-two trillion, twenty billion, one hundred twelve million, one hundred twenty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •