Base | Representation |
---|---|
bin | 111101100100011101… |
… | …1011001000011100011 |
3 | 110122021122022111220201 |
4 | 1323020323121003203 |
5 | 4131241311444303 |
6 | 140424022050031 |
7 | 12360351502351 |
oct | 1731073310343 |
9 | 418248274821 |
10 | 132220031203 |
11 | 5108a840467 |
12 | 21760279917 |
13 | c611aca870 |
14 | 658427c7d1 |
15 | 368cbda81d |
hex | 1ec8ed90e3 |
132220031203 has 4 divisors (see below), whose sum is σ = 142390802848. Its totient is φ = 122049259560.
The previous prime is 132220031197. The next prime is 132220031233. The reversal of 132220031203 is 302130022231.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 302130022231 = 127 ⋅2378976553.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132220031203 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132220031233) 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, 5085385803 + ... + 5085385828.
It is an arithmetic number, because the mean of its divisors is an integer number (35597700712).
Almost surely, 2132220031203 is an apocalyptic number.
132220031203 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
132220031203 is a deficient number, since it is larger than the sum of its proper divisors (10170771645).
132220031203 is a wasteful number, since it uses less digits than its factorization.
132220031203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10170771644.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 132220031203 its reverse (302130022231), we get a palindrome (434350053434).
The spelling of 132220031203 in words is "one hundred thirty-two billion, two hundred twenty million, thirty-one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •