Base | Representation |
---|---|
bin | 1001001001010010000001… |
… | …10000011010101111000000 |
3 | 2122012111202001220111012011 |
4 | 10210221000300122233000 |
5 | 10113441013032022422 |
6 | 110434244010542304 |
7 | 4143623413525456 |
oct | 444510060325700 |
9 | 78174661814164 |
10 | 20110123314112 |
11 | 6453723382937 |
12 | 2309587737994 |
13 | b2b4b81c8170 |
14 | 4d74999809d6 |
15 | 24d19cbdb077 |
hex | 124a40c1abc0 |
20110123314112 has 112 divisors (see below), whose sum is σ = 45242033427360. Its totient is φ = 8792228671488.
The previous prime is 20110123314107. The next prime is 20110123314143. The reversal of 20110123314112 is 21141332101102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 177198378 + ... + 177311830.
It is an arithmetic number, because the mean of its divisors is an integer number (403946727030).
Almost surely, 220110123314112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20110123314112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22621016713680).
20110123314112 is an abundant number, since it is smaller than the sum of its proper divisors (25131910113248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20110123314112 is a wasteful number, since it uses less digits than its factorization.
20110123314112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 124710 (or 124700 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 20110123314112 its reverse (21141332101102), we get a palindrome (41251455415214).
The spelling of 20110123314112 in words is "twenty trillion, one hundred ten billion, one hundred twenty-three million, three hundred fourteen thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •