Base | Representation |
---|---|
bin | 1001001001100100011101… |
… | …10101001001011000110111 |
3 | 2122020110022000010021210102 |
4 | 10210302032311021120313 |
5 | 10114121301404024343 |
6 | 110443002213544315 |
7 | 4144423633441640 |
oct | 444621665113067 |
9 | 78213260107712 |
10 | 20120023111223 |
11 | 6457943577a42 |
12 | 230b48b04509b |
13 | b2c405200689 |
14 | 4d7b5869c6c7 |
15 | 24d57bda43b8 |
hex | 124c8ed49637 |
20120023111223 has 32 divisors (see below), whose sum is σ = 24091684070400. Its totient is φ = 16438506948864.
The previous prime is 20120023111163. The next prime is 20120023111231. The reversal of 20120023111223 is 32211132002102.
It is not a de Polignac number, because 20120023111223 - 210 = 20120023110199 is a prime.
It is a super-2 number, since 2×201200231112232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20120023111195 and 20120023111204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20120023111823) 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, 10828736 + ... + 12549962.
It is an arithmetic number, because the mean of its divisors is an integer number (752865127200).
Almost surely, 220120023111223 is an apocalyptic number.
20120023111223 is a deficient number, since it is larger than the sum of its proper divisors (3971660959177).
20120023111223 is a wasteful number, since it uses less digits than its factorization.
20120023111223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1721999.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 20120023111223 its reverse (32211132002102), we get a palindrome (52331155113325).
The spelling of 20120023111223 in words is "twenty trillion, one hundred twenty billion, twenty-three million, one hundred eleven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •