Base | Representation |
---|---|
bin | 1001001001101000111001… |
… | …01001011011001100011111 |
3 | 2122020200102211011211122220 |
4 | 10210310130221123030133 |
5 | 10114141140003344403 |
6 | 110444034250240423 |
7 | 4144536614206650 |
oct | 444643451331437 |
9 | 78220384154586 |
10 | 20122402403103 |
11 | 6458954626170 |
12 | 230ba33a26113 |
13 | b2c6c41187b0 |
14 | 4d7d0268b527 |
15 | 24d66abd9953 |
hex | 124d1ca5b31f |
20122402403103 has 64 divisors (see below), whose sum is σ = 36024212324352. Its totient is φ = 9648865514880.
The previous prime is 20122402403093. The next prime is 20122402403111. The reversal of 20122402403103 is 30130420422102.
It is a happy number.
It is not a de Polignac number, because 20122402403103 - 25 = 20122402403071 is a prime.
It is a super-2 number, since 2×201224024031032 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20122402403123) 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 63 ways as a sum of consecutive naturals, for example, 210783900 + ... + 210879342.
It is an arithmetic number, because the mean of its divisors is an integer number (562878317568).
Almost surely, 220122402403103 is an apocalyptic number.
20122402403103 is a deficient number, since it is larger than the sum of its proper divisors (15901809921249).
20122402403103 is a wasteful number, since it uses less digits than its factorization.
20122402403103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165684.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 20122402403103 its reverse (30130420422102), we get a palindrome (50252822825205).
The spelling of 20122402403103 in words is "twenty trillion, one hundred twenty-two billion, four hundred two million, four hundred three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •