Base | Representation |
---|---|
bin | 1100000001001010001000… |
… | …1111101110011111110111 |
3 | 1201210020202021012222020211 |
4 | 3000102202033232133313 |
5 | 3212444324101342403 |
6 | 44034240303210251 |
7 | 2532453156644146 |
oct | 300224217563767 |
9 | 51706667188224 |
10 | 13214041434103 |
11 | 423505299a194 |
12 | 1594b778a6987 |
13 | 74b104062983 |
14 | 3397c4cc775d |
15 | 17dada6c606d |
hex | c04a23ee7f7 |
13214041434103 has 4 divisors (see below), whose sum is σ = 13231224843760. Its totient is φ = 13196858024448.
The previous prime is 13214041434101. The next prime is 13214041434179. The reversal of 13214041434103 is 30143414041231.
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 13214041434103 - 21 = 13214041434101 is a prime.
It is a super-2 number, since 2×132140414341032 (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 (13214041434101) 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, 8591703675 + ... + 8591705212.
It is an arithmetic number, because the mean of its divisors is an integer number (3307806210940).
Almost surely, 213214041434103 is an apocalyptic number.
13214041434103 is a deficient number, since it is larger than the sum of its proper divisors (17183409657).
13214041434103 is an equidigital number, since it uses as much as digits as its factorization.
13214041434103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17183409656.
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 13214041434103 its reverse (30143414041231), we get a palindrome (43357455475334).
The spelling of 13214041434103 in words is "thirteen trillion, two hundred fourteen billion, forty-one million, four hundred thirty-four thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •