Base | Representation |
---|---|
bin | 11001000000111010110011… |
… | …011001001011011110010001 |
3 | 112102112021010212100210102101 |
4 | 121000322303121023132101 |
5 | 103404433242310321001 |
6 | 1025551512254120401 |
7 | 32113161651051160 |
oct | 3100726331133621 |
9 | 472467125323371 |
10 | 110014302042001 |
11 | 32065892488015 |
12 | 104096131b0101 |
13 | 49503c53446c6 |
14 | 1d24a1359d3d7 |
15 | cabad0109a01 |
hex | 640eb364b791 |
110014302042001 has 32 divisors (see below), whose sum is σ = 129942027806976. Its totient is φ = 91180373760000.
The previous prime is 110014302041999. The next prime is 110014302042023. The reversal of 110014302042001 is 100240203410011.
It is not a de Polignac number, because 110014302042001 - 21 = 110014302041999 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110014302042001.
It is not an unprimeable number, because it can be changed into a prime (110014302043001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1162636471 + ... + 1162731091.
It is an arithmetic number, because the mean of its divisors is an integer number (4060688368968).
Almost surely, 2110014302042001 is an apocalyptic number.
It is an amenable number.
110014302042001 is a deficient number, since it is larger than the sum of its proper divisors (19927725764975).
110014302042001 is a wasteful number, since it uses less digits than its factorization.
110014302042001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130633.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 110014302042001 its reverse (100240203410011), we get a palindrome (210254505452012).
The spelling of 110014302042001 in words is "one hundred ten trillion, fourteen billion, three hundred two million, forty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •