Base | Representation |
---|---|
bin | 11001000001010100000101… |
… | …001000001001110110110101 |
3 | 112102121212012101002010102211 |
4 | 121001110011020021312311 |
5 | 103410404333414130141 |
6 | 1030012201401333421 |
7 | 32115142354262200 |
oct | 3101240510116665 |
9 | 472555171063384 |
10 | 110041443114421 |
11 | 3207634a955485 |
12 | 10412928797271 |
13 | 4952b2c319780 |
14 | 1d2606a044937 |
15 | cac66cc58d81 |
hex | 641505209db5 |
110041443114421 has 48 divisors (see below), whose sum is σ = 145116624945600. Its totient is φ = 82479353144832.
The previous prime is 110041443114409. The next prime is 110041443114431. The reversal of 110041443114421 is 124411344140011.
It is not a de Polignac number, because 110041443114421 - 213 = 110041443106229 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110041443114431) 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 47 ways as a sum of consecutive naturals, for example, 262583070 + ... + 263001808.
It is an arithmetic number, because the mean of its divisors is an integer number (3023263019700).
Almost surely, 2110041443114421 is an apocalyptic number.
It is an amenable number.
110041443114421 is a deficient number, since it is larger than the sum of its proper divisors (35075181831179).
110041443114421 is a wasteful number, since it uses less digits than its factorization.
110041443114421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 440498 (or 440491 counting only the distinct ones).
The product of its (nonzero) digits is 6144, while the sum is 31.
Adding to 110041443114421 its reverse (124411344140011), we get a palindrome (234452787254432).
The spelling of 110041443114421 in words is "one hundred ten trillion, forty-one billion, four hundred forty-three million, one hundred fourteen thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •