Base | Representation |
---|---|
bin | 1011111011000110101110… |
… | …0001111011100000110101 |
3 | 1201102022022112011100001000 |
4 | 2332301223201323200311 |
5 | 3204243332311302041 |
6 | 43514400550353513 |
7 | 2522112055264224 |
oct | 276615341734065 |
9 | 51368275140030 |
10 | 13110044244021 |
11 | 41a4a3621a00a |
12 | 157899335b899 |
13 | 74136c3a67ca |
14 | 33475b044cbb |
15 | 17b0505bdbb6 |
hex | bec6b87b835 |
13110044244021 has 16 divisors (see below), whose sum is σ = 19429373718720. Its totient is φ = 8736840818640.
The previous prime is 13110044244007. The next prime is 13110044244041. The reversal of 13110044244021 is 12044244001131.
13110044244021 is a `hidden beast` number, since 131 + 100 + 4 + 4 + 24 + 402 + 1 = 666.
It is not a de Polignac number, because 13110044244021 - 221 = 13110042146869 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13110044244041) 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, 88498995 + ... + 88647008.
It is an arithmetic number, because the mean of its divisors is an integer number (1214335857420).
Almost surely, 213110044244021 is an apocalyptic number.
It is an amenable number.
13110044244021 is a deficient number, since it is larger than the sum of its proper divisors (6319329474699).
13110044244021 is a wasteful number, since it uses less digits than its factorization.
13110044244021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177148753 (or 177148747 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
Adding to 13110044244021 its reverse (12044244001131), we get a palindrome (25154288245152).
The spelling of 13110044244021 in words is "thirteen trillion, one hundred ten billion, forty-four million, two hundred forty-four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •