Base | Representation |
---|---|
bin | 1001001001010110000101… |
… | …00000001100101000000111 |
3 | 2122012201100202220200012112 |
4 | 10210223002200030220013 |
5 | 10114004442311200403 |
6 | 110435244011011235 |
7 | 4144031355101351 |
oct | 444530240145007 |
9 | 78181322820175 |
10 | 20112300100103 |
11 | 6454640097422 |
12 | 2309a94739b1b |
13 | b2b77418c503 |
14 | 4d7624ad80d1 |
15 | 24d278d6e9d8 |
hex | 124ac280ca07 |
20112300100103 has 4 divisors (see below), whose sum is σ = 20112591520848. Its totient is φ = 20112008679360.
The previous prime is 20112300100093. The next prime is 20112300100219. The reversal of 20112300100103 is 30100100321102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20112300100103 - 28 = 20112300099847 is a prime.
It is a super-2 number, since 2×201123001001032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20112300100703) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 145606826 + ... + 145744887.
It is an arithmetic number, because the mean of its divisors is an integer number (5028147880212).
Almost surely, 220112300100103 is an apocalyptic number.
20112300100103 is a deficient number, since it is larger than the sum of its proper divisors (291420745).
20112300100103 is an equidigital number, since it uses as much as digits as its factorization.
20112300100103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 291420744.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 20112300100103 its reverse (30100100321102), we get a palindrome (50212400421205).
The spelling of 20112300100103 in words is "twenty trillion, one hundred twelve billion, three hundred million, one hundred thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •