Base | Representation |
---|---|
bin | 1001001001111011011000… |
… | …11100000110011010110011 |
3 | 2122021122001202121221022211 |
4 | 10210331230130012122303 |
5 | 10114322003220201003 |
6 | 110452355403112551 |
7 | 4145340634113514 |
oct | 444755434063263 |
9 | 78248052557284 |
10 | 20132331022003 |
11 | 646208a016532 |
12 | 2311944b12757 |
13 | b306170a2915 |
14 | 4d85a514ca0b |
15 | 24da4c69796d |
hex | 124f6c7066b3 |
20132331022003 has 4 divisors (see below), whose sum is σ = 20167712975160. Its totient is φ = 20096949068848.
The previous prime is 20132331021973. The next prime is 20132331022049. The reversal of 20132331022003 is 30022013323102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20132331022003 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20132331022603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17690975725 + ... + 17690976862.
It is an arithmetic number, because the mean of its divisors is an integer number (5041928243790).
Almost surely, 220132331022003 is an apocalyptic number.
20132331022003 is a deficient number, since it is larger than the sum of its proper divisors (35381953157).
20132331022003 is an equidigital number, since it uses as much as digits as its factorization.
20132331022003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35381953156.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 20132331022003 its reverse (30022013323102), we get a palindrome (50154344345105).
The spelling of 20132331022003 in words is "twenty trillion, one hundred thirty-two billion, three hundred thirty-one million, twenty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •