Base | Representation |
---|---|
bin | 1011110101111011011001… |
… | …0001110111001111101111 |
3 | 1201002210202010102022211202 |
4 | 2331132312101313033233 |
5 | 3201314210111311343 |
6 | 43405451304440115 |
7 | 2512513044623111 |
oct | 275366621671757 |
9 | 51083663368752 |
10 | 13021104010223 |
11 | 4170245832a61 |
12 | 15636b147903b |
13 | 735b66cb912a |
14 | 330320bb13b1 |
15 | 178a972cbdb8 |
hex | bd7b64773ef |
13021104010223 has 8 divisors (see below), whose sum is σ = 14231794896000. Its totient is φ = 11859829079040.
The previous prime is 13021104010207. The next prime is 13021104010231. The reversal of 13021104010223 is 32201040112031.
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 13021104010223 - 24 = 13021104010207 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13021104010195 and 13021104010204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13021104010253) 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, 12353988098 + ... + 12353989151.
It is an arithmetic number, because the mean of its divisors is an integer number (1778974362000).
Almost surely, 213021104010223 is an apocalyptic number.
13021104010223 is a deficient number, since it is larger than the sum of its proper divisors (1210690885777).
13021104010223 is a wasteful number, since it uses less digits than its factorization.
13021104010223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24707977297.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 13021104010223 its reverse (32201040112031), we get a palindrome (45222144122254).
The spelling of 13021104010223 in words is "thirteen trillion, twenty-one billion, one hundred four million, ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •