Base | Representation |
---|---|
bin | 1001001001010100000101… |
… | …10101110000111100001100 |
3 | 2122012121121100010011211112 |
4 | 10210222002311300330030 |
5 | 10114000300343341134 |
6 | 110434550014111152 |
7 | 4143663035356115 |
oct | 444520265607414 |
9 | 78177540104745 |
10 | 20111232012044 |
11 | 6454142199018 |
12 | 2309836aab4b8 |
13 | b2b633b02b44 |
14 | 4d7562d0520c |
15 | 24d2151de1ce |
hex | 124a82d70f0c |
20111232012044 has 24 divisors (see below), whose sum is σ = 37991232891360. Its totient is φ = 9286745815424.
The previous prime is 20111232012043. The next prime is 20111232012061. The reversal of 20111232012044 is 44021023211102.
It is a super-2 number, since 2×201112320120442 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is not an unprimeable number, because it can be changed into a prime (20111232012041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3768968849 + ... + 3768974184.
It is an arithmetic number, because the mean of its divisors is an integer number (1582968037140).
Almost surely, 220111232012044 is an apocalyptic number.
It is an amenable number.
20111232012044 is a deficient number, since it is larger than the sum of its proper divisors (17880000879316).
20111232012044 is a wasteful number, since it uses less digits than its factorization.
20111232012044 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7537943089 (or 7537943087 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 20111232012044 its reverse (44021023211102), we get a palindrome (64132255223146).
The spelling of 20111232012044 in words is "twenty trillion, one hundred eleven billion, two hundred thirty-two million, twelve thousand, forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •