Base | Representation |
---|---|
bin | 1100000001000110101000… |
… | …1100010011100101000001 |
3 | 1201210011022201122122110012 |
4 | 3000101222030103211001 |
5 | 3212440412324411223 |
6 | 44034003110514305 |
7 | 2532420650335445 |
oct | 300215214234501 |
9 | 51704281578405 |
10 | 13213101013313 |
11 | 423471006a123 |
12 | 1594954965995 |
13 | 74acb4286076 |
14 | 339736048825 |
15 | 17da82d62c78 |
hex | c046a313941 |
13213101013313 has 8 divisors (see below), whose sum is σ = 13431148137960. Its totient is φ = 12995100305280.
The previous prime is 13213101013279. The next prime is 13213101013327. The reversal of 13213101013313 is 31331010131231.
It can be written as a sum of positive squares in 4 ways, for example, as 2782998005824 + 10430103007489 = 1668232^2 + 3229567^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13213101013313 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13213101013813) 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, 11029898 + ... + 12169011.
It is an arithmetic number, because the mean of its divisors is an integer number (1678893517245).
Almost surely, 213213101013313 is an apocalyptic number.
It is an amenable number.
13213101013313 is a deficient number, since it is larger than the sum of its proper divisors (218047124647).
13213101013313 is an equidigital number, since it uses as much as digits as its factorization.
13213101013313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23208307.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 13213101013313 its reverse (31331010131231), we get a palindrome (44544111144544).
The spelling of 13213101013313 in words is "thirteen trillion, two hundred thirteen billion, one hundred one million, thirteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •