Base | Representation |
---|---|
bin | 1011111010100010100100… |
… | …1000110100110101010011 |
3 | 1201101101021020201121201121 |
4 | 2332220221020310311103 |
5 | 3204113444122312321 |
6 | 43510114024143111 |
7 | 2521316435244544 |
oct | 276505110646523 |
9 | 51341236647647 |
10 | 13100340432211 |
11 | 41a090671562a |
12 | 1576b25607a97 |
13 | 740483b81126 |
14 | 3340ba3824cb |
15 | 17ab8371a441 |
hex | bea29234d53 |
13100340432211 has 8 divisors (see below), whose sum is σ = 13115434402224. Its totient is φ = 13085246972160.
The previous prime is 13100340432197. The next prime is 13100340432233. The reversal of 13100340432211 is 11223404300131.
13100340432211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13100340432211 - 227 = 13100206214483 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13100340402211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 80430591 + ... + 80593303.
It is an arithmetic number, because the mean of its divisors is an integer number (1639429300278).
Almost surely, 213100340432211 is an apocalyptic number.
13100340432211 is a deficient number, since it is larger than the sum of its proper divisors (15093970013).
13100340432211 is an equidigital number, since it uses as much as digits as its factorization.
13100340432211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 254981.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 13100340432211 its reverse (11223404300131), we get a palindrome (24323744732342).
The spelling of 13100340432211 in words is "thirteen trillion, one hundred billion, three hundred forty million, four hundred thirty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •