Base | Representation |
---|---|
bin | 1001001101101110011100… |
… | …0110111101000110101011 |
3 | 1022212112221101210022112212 |
4 | 2103123213012331012223 |
5 | 2311443112010302021 |
6 | 33314150002355335 |
7 | 2063653535111240 |
oct | 223334706750653 |
9 | 38775841708485 |
10 | 10131410244011 |
11 | 3256785a59371 |
12 | 117765095bb4b |
13 | 586507257464 |
14 | 270511a155c7 |
15 | 12881b9c185b |
hex | 936e71bd1ab |
10131410244011 has 4 divisors (see below), whose sum is σ = 11578754564592. Its totient is φ = 8684065923432.
The previous prime is 10131410244001. The next prime is 10131410244031. The reversal of 10131410244011 is 11044201413101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10131410244011 is a prime.
It is a super-2 number, since 2×101314102440112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10131410244001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 723672160280 + ... + 723672160293.
It is an arithmetic number, because the mean of its divisors is an integer number (2894688641148).
Almost surely, 210131410244011 is an apocalyptic number.
10131410244011 is a deficient number, since it is larger than the sum of its proper divisors (1447344320581).
10131410244011 is an equidigital number, since it uses as much as digits as its factorization.
10131410244011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1447344320580.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 10131410244011 its reverse (11044201413101), we get a palindrome (21175611657112).
The spelling of 10131410244011 in words is "ten trillion, one hundred thirty-one billion, four hundred ten million, two hundred forty-four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •