Base | Representation |
---|---|
bin | 1001001001111010110100… |
… | …00110010110110111001111 |
3 | 2122021121021022122200102000 |
4 | 10210331122012112313033 |
5 | 10114320340433113203 |
6 | 110452305052203343 |
7 | 4145330206566141 |
oct | 444753206266717 |
9 | 78247238580360 |
10 | 20132023332303 |
11 | 6461a4136a723 |
12 | 2311879a69553 |
13 | b305984119cc |
14 | 4d8576336c91 |
15 | 24da3066a4a3 |
hex | 124f5a196dcf |
20132023332303 has 32 divisors (see below), whose sum is σ = 29879947396800. Its totient is φ = 13396738687488.
The previous prime is 20132023332301. The next prime is 20132023332341. The reversal of 20132023332303 is 30323332023102.
20132023332303 is a `hidden beast` number, since 2 + 0 + 1 + 3 + 2 + 0 + 23 + 332 + 303 = 666.
It is not a de Polignac number, because 20132023332303 - 21 = 20132023332301 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20132023332301) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 42055363 + ... + 42531371.
It is an arithmetic number, because the mean of its divisors is an integer number (933748356150).
Almost surely, 220132023332303 is an apocalyptic number.
20132023332303 is a deficient number, since it is larger than the sum of its proper divisors (9747924064497).
20132023332303 is a wasteful number, since it uses less digits than its factorization.
20132023332303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 478888 (or 478882 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 27.
Adding to 20132023332303 its reverse (30323332023102), we get a palindrome (50455355355405).
The spelling of 20132023332303 in words is "twenty trillion, one hundred thirty-two billion, twenty-three million, three hundred thirty-two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •