Base | Representation |
---|---|
bin | 11001000111000110000011… |
… | …110110010000010101101001 |
3 | 112111000211121022111202222102 |
4 | 121013012003312100111221 |
5 | 103433411432231320131 |
6 | 1030514501410303145 |
7 | 32155635043150565 |
oct | 3107060366202551 |
9 | 474024538452872 |
10 | 110438706120041 |
11 | 32209879523452 |
12 | 10477917287ab5 |
13 | 498142c8ba8c0 |
14 | 1d3b3949046a5 |
15 | cb7b6e2111cb |
hex | 647183d90569 |
110438706120041 has 16 divisors (see below), whose sum is σ = 118973537233488. Its totient is φ = 101909527315200.
The previous prime is 110438706120023. The next prime is 110438706120073. The reversal of 110438706120041 is 140021607834011.
It can be written as a sum of positive squares in 8 ways, for example, as 3422577700441 + 107016128419600 = 1850021^2 + 10344860^2 .
It is a cyclic number.
It is not a de Polignac number, because 110438706120041 - 218 = 110438705857897 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110438706119977 and 110438706120004.
It is not an unprimeable number, because it can be changed into a prime (110438706120091) 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, 1237211351 + ... + 1237300611.
It is an arithmetic number, because the mean of its divisors is an integer number (7435846077093).
Almost surely, 2110438706120041 is an apocalyptic number.
It is an amenable number.
110438706120041 is a deficient number, since it is larger than the sum of its proper divisors (8534831113447).
110438706120041 is a wasteful number, since it uses less digits than its factorization.
110438706120041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119852.
The product of its (nonzero) digits is 32256, while the sum is 38.
The spelling of 110438706120041 in words is "one hundred ten trillion, four hundred thirty-eight billion, seven hundred six million, one hundred twenty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •