Base | Representation |
---|---|
bin | 1100001100000110011011… |
… | …0010010010001001101111 |
3 | 1202110012221222121112110121 |
4 | 3003001212302102021233 |
5 | 3224034320214433403 |
6 | 44300445404145411 |
7 | 2552156415656011 |
oct | 303014662221157 |
9 | 52405858545417 |
10 | 13402022421103 |
11 | 42a78472a2a98 |
12 | 160549a238267 |
13 | 762a612c1224 |
14 | 344938a3c1b1 |
15 | 18393d8c13bd |
hex | c3066c9226f |
13402022421103 has 4 divisors (see below), whose sum is σ = 13540187600800. Its totient is φ = 13263857241408.
The previous prime is 13402022421079. The next prime is 13402022421107. The reversal of 13402022421103 is 30112422020431.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13402022421103 is a prime.
It is a super-2 number, since 2×134020224211032 (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 (13402022421107) 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, 69082589703 + ... + 69082589896.
It is an arithmetic number, because the mean of its divisors is an integer number (3385046900200).
Almost surely, 213402022421103 is an apocalyptic number.
13402022421103 is a deficient number, since it is larger than the sum of its proper divisors (138165179697).
13402022421103 is an equidigital number, since it uses as much as digits as its factorization.
13402022421103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 138165179696.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 13402022421103 its reverse (30112422020431), we get a palindrome (43514444441534).
The spelling of 13402022421103 in words is "thirteen trillion, four hundred two billion, twenty-two million, four hundred twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •