Base | Representation |
---|---|
bin | 1010000000010010110010… |
… | …10001110011110101110011 |
3 | 2212220012200011001212022111 |
4 | 11000021121101303311303 |
5 | 10340423124001043443 |
6 | 114442450240550151 |
7 | 4430320306214641 |
oct | 500113121636563 |
9 | 85805604055274 |
10 | 22000320331123 |
11 | 7012313309392 |
12 | 2573986922357 |
13 | c37810013c44 |
14 | 560b6d494191 |
15 | 28242b03b69d |
hex | 140259473d73 |
22000320331123 has 16 divisors (see below), whose sum is σ = 22220011183104. Its totient is φ = 21781370257920.
The previous prime is 22000320331117. The next prime is 22000320331151. The reversal of 22000320331123 is 32113302300022.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22000320331123 is a prime.
It is a super-2 number, since 2×220003203311232 (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 = 22000320331094 and 22000320331103.
It is not an unprimeable number, because it can be changed into a prime (22000320331723) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 423244311 + ... + 423296287.
It is an arithmetic number, because the mean of its divisors is an integer number (1388750698944).
Almost surely, 222000320331123 is an apocalyptic number.
22000320331123 is a deficient number, since it is larger than the sum of its proper divisors (219690851981).
22000320331123 is a wasteful number, since it uses less digits than its factorization.
22000320331123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59022.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 22000320331123 its reverse (32113302300022), we get a palindrome (54113622631145).
The spelling of 22000320331123 in words is "twenty-two trillion, three hundred twenty million, three hundred thirty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.143 sec. • engine limits •