Base | Representation |
---|---|
bin | 1100000110100010100110… |
… | …0110100001001011000101 |
3 | 1202010002102022211102122101 |
4 | 3001220221212201023011 |
5 | 3221003211200134323 |
6 | 44144531425432101 |
7 | 2542235432200054 |
oct | 301505146411305 |
9 | 52102368742571 |
10 | 13306506646213 |
11 | 4270292113660 |
12 | 15aaa8219b631 |
13 | 756a4b824031 |
14 | 34007737c39b |
15 | 1811ed1aadad |
hex | c1a299a12c5 |
13306506646213 has 8 divisors (see below), whose sum is σ = 14516215937280. Its totient is φ = 12096801833280.
The previous prime is 13306506646183. The next prime is 13306506646219. The reversal of 13306506646213 is 31264660560331.
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 13306506646213 - 29 = 13306506645701 is a prime.
It is a super-2 number, since 2×133065066462132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13306506646219) 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, 9352108 + ... + 10680586.
It is an arithmetic number, because the mean of its divisors is an integer number (1814526992160).
Almost surely, 213306506646213 is an apocalyptic number.
It is an amenable number.
13306506646213 is a deficient number, since it is larger than the sum of its proper divisors (1209709291067).
13306506646213 is a wasteful number, since it uses less digits than its factorization.
13306506646213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2239067.
The product of its (nonzero) digits is 1399680, while the sum is 46.
The spelling of 13306506646213 in words is "thirteen trillion, three hundred six billion, five hundred six million, six hundred forty-six thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •