Base | Representation |
---|---|
bin | 1001001001101010011000… |
… | …11000101001100110000011 |
3 | 2122020202111122020020010111 |
4 | 10210311030120221212003 |
5 | 10114144310021441003 |
6 | 110444245540412151 |
7 | 4144565510630221 |
oct | 444651430514603 |
9 | 78222448206114 |
10 | 20123203312003 |
11 | 6459225727950 |
12 | 23100180a7057 |
13 | b2c7c102929c |
14 | 4d7d7abb1b11 |
15 | 24d6b6190e6d |
hex | 124d4c629983 |
20123203312003 has 8 divisors (see below), whose sum is σ = 22230466260480. Its totient is φ = 18062253835080.
The previous prime is 20123203311961. The next prime is 20123203312019. The reversal of 20123203312003 is 30021330232102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20123203312003 - 225 = 20123169757571 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20123203312063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11578366975 + ... + 11578368712.
It is an arithmetic number, because the mean of its divisors is an integer number (2778808282560).
Almost surely, 220123203312003 is an apocalyptic number.
20123203312003 is a deficient number, since it is larger than the sum of its proper divisors (2107262948477).
20123203312003 is a wasteful number, since it uses less digits than its factorization.
20123203312003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23156735777.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 20123203312003 its reverse (30021330232102), we get a palindrome (50144533544105).
The spelling of 20123203312003 in words is "twenty trillion, one hundred twenty-three billion, two hundred three million, three hundred twelve thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •