Base | Representation |
---|---|
bin | 1001101000011111011111… |
… | …1101010010110010001001 |
3 | 1101111111212201202001101210 |
4 | 2122013313331102302021 |
5 | 2342011342113042323 |
6 | 34305315523203333 |
7 | 2142123105132264 |
oct | 232076775226211 |
9 | 41444781661353 |
10 | 10591254424713 |
11 | 34137a9011446 |
12 | 12307a5816549 |
13 | 5ba99bc670c1 |
14 | 288895aa9cdb |
15 | 1357820de293 |
hex | 9a1f7f52c89 |
10591254424713 has 4 divisors (see below), whose sum is σ = 14121672566288. Its totient is φ = 7060836283140.
The previous prime is 10591254424697. The next prime is 10591254424717. The reversal of 10591254424713 is 31742445219501.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 10591254424713 - 24 = 10591254424697 is a prime.
It is a super-2 number, since 2×105912544247132 (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 (10591254424717) 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, 1765209070783 + ... + 1765209070788.
It is an arithmetic number, because the mean of its divisors is an integer number (3530418141572).
Almost surely, 210591254424713 is an apocalyptic number.
It is an amenable number.
10591254424713 is a deficient number, since it is larger than the sum of its proper divisors (3530418141575).
10591254424713 is an equidigital number, since it uses as much as digits as its factorization.
10591254424713 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3530418141574.
The product of its (nonzero) digits is 1209600, while the sum is 48.
The spelling of 10591254424713 in words is "ten trillion, five hundred ninety-one billion, two hundred fifty-four million, four hundred twenty-four thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •