Base | Representation |
---|---|
bin | 1011111010101000110000… |
… | …1100011101100110100111 |
3 | 1201101112120001212202221102 |
4 | 2332222030030131212213 |
5 | 3204130400044030043 |
6 | 43510550552310315 |
7 | 2521405555164635 |
oct | 276521414354647 |
9 | 51345501782842 |
10 | 13102002330023 |
11 | 41a1589823aa2 |
12 | 157730a0a239b |
13 | 74068a279909 |
14 | 3341d6d8a355 |
15 | 17ac2e5946b8 |
hex | bea8c31d9a7 |
13102002330023 has 8 divisors (see below), whose sum is σ = 13316970564096. Its totient is φ = 12887039944800.
The previous prime is 13102002330007. The next prime is 13102002330073. The reversal of 13102002330023 is 32003320020131.
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 13102002330023 - 24 = 13102002330007 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13102002329977 and 13102002330004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13102002330073) 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, 3174365 + ... + 6023337.
It is an arithmetic number, because the mean of its divisors is an integer number (1664621320512).
Almost surely, 213102002330023 is an apocalyptic number.
13102002330023 is a deficient number, since it is larger than the sum of its proper divisors (214968234073).
13102002330023 is an equidigital number, since it uses as much as digits as its factorization.
13102002330023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2924425.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 13102002330023 its reverse (32003320020131), we get a palindrome (45105322350154).
The spelling of 13102002330023 in words is "thirteen trillion, one hundred two billion, two million, three hundred thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •