Base | Representation |
---|---|
bin | 11110000000110110100111… |
… | …000001001010111111011011 |
3 | 122022101002011012002102110222 |
4 | 132000312213001022333123 |
5 | 114300142031143311303 |
6 | 1144423551053030255 |
7 | 36542454563246660 |
oct | 3600664701127733 |
9 | 568332135072428 |
10 | 132000032010203 |
11 | 39071998921825 |
12 | 1297a5a778538b |
13 | 588671b6464b6 |
14 | 2484b9adc1a67 |
15 | 103d95529a938 |
hex | 780da704afdb |
132000032010203 has 16 divisors (see below), whose sum is σ = 152051798999040. Its totient is φ = 112246999222176.
The previous prime is 132000032010173. The next prime is 132000032010241. The reversal of 132000032010203 is 302010230000231.
It is not a de Polignac number, because 132000032010203 - 238 = 131725154103259 is a prime.
It is a super-2 number, since 2×1320000320102032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132000032010263) 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, 16747433 + ... + 23334021.
It is an arithmetic number, because the mean of its divisors is an integer number (9503237437440).
Almost surely, 2132000032010203 is an apocalyptic number.
132000032010203 is a deficient number, since it is larger than the sum of its proper divisors (20051766988837).
132000032010203 is a wasteful number, since it uses less digits than its factorization.
132000032010203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6609266.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 132000032010203 its reverse (302010230000231), we get a palindrome (434010262010434).
The spelling of 132000032010203 in words is "one hundred thirty-two trillion, thirty-two million, ten thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •