Base | Representation |
---|---|
bin | 1100000001000011101100… |
… | …0100000011011111001111 |
3 | 1201210002021121211022122112 |
4 | 3000100323010003133033 |
5 | 3212432302420233403 |
6 | 44033352423334235 |
7 | 2532362236506365 |
oct | 300207304033717 |
9 | 51702247738575 |
10 | 13212310321103 |
11 | 4234344806393 |
12 | 1594773bb137b |
13 | 74abb951195a |
14 | 33969d023635 |
15 | 17da387289d8 |
hex | c043b1037cf |
13212310321103 has 4 divisors (see below), whose sum is σ = 13409508982680. Its totient is φ = 13015111659528.
The previous prime is 13212310321057. The next prime is 13212310321109. The reversal of 13212310321103 is 30112301321231.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13212310321103 - 236 = 13143590844367 is a prime.
It is a super-2 number, since 2×132123103211032 (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 (13212310321109) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 98599330688 + ... + 98599330821.
It is an arithmetic number, because the mean of its divisors is an integer number (3352377245670).
Almost surely, 213212310321103 is an apocalyptic number.
13212310321103 is a deficient number, since it is larger than the sum of its proper divisors (197198661577).
13212310321103 is an equidigital number, since it uses as much as digits as its factorization.
13212310321103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 197198661576.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 13212310321103 its reverse (30112301321231), we get a palindrome (43324611642334).
The spelling of 13212310321103 in words is "thirteen trillion, two hundred twelve billion, three hundred ten million, three hundred twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •