Base | Representation |
---|---|
bin | 1001001010001011101110… |
… | …10110100001100000000000 |
3 | 2122022110201011121122002122 |
4 | 10211011313112201200000 |
5 | 10114442440113402112 |
6 | 110500410115303412 |
7 | 4146101222426306 |
oct | 445056726414000 |
9 | 78273634548078 |
10 | 20141104044032 |
11 | 6465881178864 |
12 | 2313592baab68 |
13 | b313b481130a |
14 | 4d8b9835c276 |
15 | 24ddb298b872 |
hex | 1251775a1800 |
20141104044032 has 48 divisors (see below), whose sum is σ = 40281303862800. Its totient is φ = 10068318904320.
The previous prime is 20141104043999. The next prime is 20141104044043. The reversal of 20141104044032 is 23044040114102.
It is a super-2 number, since 2×201411040440322 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20141104043992 and 20141104044010.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8166782 + ... + 10343042.
It is an arithmetic number, because the mean of its divisors is an integer number (839193830475).
Almost surely, 220141104044032 is an apocalyptic number.
It is an amenable number.
20141104044032 is a deficient number, since it is larger than the sum of its proper divisors (20140199818768).
20141104044032 is an equidigital number, since it uses as much as digits as its factorization.
20141104044032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2180802 (or 2180782 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 26.
Adding to 20141104044032 its reverse (23044040114102), we get a palindrome (43185144158134).
The spelling of 20141104044032 in words is "twenty trillion, one hundred forty-one billion, one hundred four million, forty-four thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •