Base | Representation |
---|---|
bin | 1011111011000110111011… |
… | …1000001001110100100001 |
3 | 1201102022110102211102112110 |
4 | 2332301232320021310201 |
5 | 3204243441200321231 |
6 | 43514410314145533 |
7 | 2522113336515411 |
oct | 276615670116441 |
9 | 51368412742473 |
10 | 13110100401441 |
11 | 41a4a649959aa |
12 | 15789aa1222a9 |
13 | 74137ac09754 |
14 | 3347646a2641 |
15 | 17b0554b3046 |
hex | bec6ee09d21 |
13110100401441 has 8 divisors (see below), whose sum is σ = 17591472301504. Its totient is φ = 8684397717840.
The previous prime is 13110100401427. The next prime is 13110100401499. The reversal of 13110100401441 is 14410400101131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-13110100401441 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (13110102401441) 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 7 ways as a sum of consecutive naturals, for example, 13917303565 + ... + 13917304506.
It is an arithmetic number, because the mean of its divisors is an integer number (2198934037688).
Almost surely, 213110100401441 is an apocalyptic number.
It is an amenable number.
13110100401441 is a deficient number, since it is larger than the sum of its proper divisors (4481371900063).
13110100401441 is a wasteful number, since it uses less digits than its factorization.
13110100401441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27834608231.
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 13110100401441 its reverse (14410400101131), we get a palindrome (27520500502572).
The spelling of 13110100401441 in words is "thirteen trillion, one hundred ten billion, one hundred million, four hundred one thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •