Base | Representation |
---|---|
bin | 1100000000111011111101… |
… | …0000100101101011100111 |
3 | 1201202212220212102021012022 |
4 | 3000032333100211223213 |
5 | 3212414024201411403 |
6 | 44032410344213355 |
7 | 2532256615524335 |
oct | 300167720455347 |
9 | 51685825367168 |
10 | 13210233232103 |
11 | 42334792a6706 |
12 | 159429446a25b |
13 | 74a9480b61cb |
14 | 33954321cb55 |
15 | 17d9661d9d38 |
hex | c03bf425ae7 |
13210233232103 has 4 divisors (see below), whose sum is σ = 13218382668168. Its totient is φ = 13202083796040.
The previous prime is 13210233232093. The next prime is 13210233232117. The reversal of 13210233232103 is 30123233201231.
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 13210233232103 - 24 = 13210233232087 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13210233232153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4074715601 + ... + 4074718842.
It is an arithmetic number, because the mean of its divisors is an integer number (3304595667042).
Almost surely, 213210233232103 is an apocalyptic number.
13210233232103 is a deficient number, since it is larger than the sum of its proper divisors (8149436065).
13210233232103 is an equidigital number, since it uses as much as digits as its factorization.
13210233232103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8149436064.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 13210233232103 its reverse (30123233201231), we get a palindrome (43333466433334).
The spelling of 13210233232103 in words is "thirteen trillion, two hundred ten billion, two hundred thirty-three million, two hundred thirty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •