Base | Representation |
---|---|
bin | 1011111010101001100111… |
… | …0101100010110011001111 |
3 | 1201101120011000112201200012 |
4 | 2332222121311202303033 |
5 | 3204131332141444043 |
6 | 43511025410023435 |
7 | 2521414334445104 |
oct | 276523165426317 |
9 | 51346130481605 |
10 | 13102231203023 |
11 | 41a1696a37736 |
12 | 1577372877b7b |
13 | 7406c5802c21 |
14 | 334219526aab |
15 | 17ac44703a18 |
hex | bea99d62ccf |
13102231203023 has 8 divisors (see below), whose sum is σ = 13349508749568. Its totient is φ = 12854956087584.
The previous prime is 13102231203011. The next prime is 13102231203137. The reversal of 13102231203023 is 32030213220131.
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 13102231203023 - 228 = 13101962767567 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13102231203023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13102231203823) 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, 13208786 + ... + 14166032.
It is an arithmetic number, because the mean of its divisors is an integer number (1668688593696).
Almost surely, 213102231203023 is an apocalyptic number.
13102231203023 is a deficient number, since it is larger than the sum of its proper divisors (247277546545).
13102231203023 is an equidigital number, since it uses as much as digits as its factorization.
13102231203023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1215553.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 13102231203023 its reverse (32030213220131), we get a palindrome (45132444423154).
The spelling of 13102231203023 in words is "thirteen trillion, one hundred two billion, two hundred thirty-one million, two hundred three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •