Base | Representation |
---|---|
bin | 1011111011101111100111… |
… | …1011010101000000100001 |
3 | 1201110100122200000011002212 |
4 | 2332323321323111000201 |
5 | 3204433323414420223 |
6 | 43523414223451505 |
7 | 2522651121006116 |
oct | 276737173250041 |
9 | 51410580004085 |
10 | 13121023201313 |
11 | 41a965a595135 |
12 | 157ab38156b95 |
13 | 7423cbb44241 |
14 | 3350bd1d890d |
15 | 17b4943a3278 |
hex | beef9ed5021 |
13121023201313 has 8 divisors (see below), whose sum is σ = 13276676187360. Its totient is φ = 12965981819200.
The previous prime is 13121023201277. The next prime is 13121023201331. The reversal of 13121023201313 is 31310232012131.
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 13121023201313 - 216 = 13121023135777 is a prime.
It is a super-2 number, since 2×131210232013132 (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 (13121023251313) 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, 152857823 + ... + 152943636.
It is an arithmetic number, because the mean of its divisors is an integer number (1659584523420).
Almost surely, 213121023201313 is an apocalyptic number.
It is an amenable number.
13121023201313 is a deficient number, since it is larger than the sum of its proper divisors (155652986047).
13121023201313 is a wasteful number, since it uses less digits than its factorization.
13121023201313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 305801967.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 13121023201313 its reverse (31310232012131), we get a palindrome (44431255213444).
The spelling of 13121023201313 in words is "thirteen trillion, one hundred twenty-one billion, twenty-three million, two hundred one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •