Base | Representation |
---|---|
bin | 1001001001010110001000… |
… | …11110000110000011000111 |
3 | 2122012201110002000102002021 |
4 | 10210223010132012003013 |
5 | 10114010024233301203 |
6 | 110435251150224011 |
7 | 4144032235445530 |
oct | 444530436060307 |
9 | 78181402012067 |
10 | 20112333103303 |
11 | 64546577891a1 |
12 | 2309aa37b5007 |
13 | b2b77ac7642c |
14 | 4d7629249687 |
15 | 24d27bbdd5bd |
hex | 124ac47860c7 |
20112333103303 has 32 divisors (see below), whose sum is σ = 24721827204096. Its totient is φ = 15988571520768.
The previous prime is 20112333103301. The next prime is 20112333103339. The reversal of 20112333103303 is 30330133321102.
It is not a de Polignac number, because 20112333103303 - 21 = 20112333103301 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20112333103301) 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 31 ways as a sum of consecutive naturals, for example, 9654276 + ... + 11551177.
It is an arithmetic number, because the mean of its divisors is an integer number (772557100128).
Almost surely, 220112333103303 is an apocalyptic number.
20112333103303 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
20112333103303 is a deficient number, since it is larger than the sum of its proper divisors (4609494100793).
20112333103303 is a wasteful number, since it uses less digits than its factorization.
20112333103303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21205663.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 20112333103303 its reverse (30330133321102), we get a palindrome (50442466424405).
The spelling of 20112333103303 in words is "twenty trillion, one hundred twelve billion, three hundred thirty-three million, one hundred three thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •