Base | Representation |
---|---|
bin | 1100001100111100111010… |
… | …1110000100001100110011 |
3 | 1202111121201110221202122211 |
4 | 3003033032232010030303 |
5 | 3224304300132011411 |
6 | 44311305134312551 |
7 | 2553215056152151 |
oct | 303171656041463 |
9 | 52447643852584 |
10 | 13416651047731 |
11 | 4302a73821768 |
12 | 16082a1358757 |
13 | 764252c0c809 |
14 | 3455257d03d1 |
15 | 183ee7cc9221 |
hex | c33ceb84333 |
13416651047731 has 4 divisors (see below), whose sum is σ = 13417076019952. Its totient is φ = 13416226075512.
The previous prime is 13416651047711. The next prime is 13416651047741. The reversal of 13416651047731 is 13774015661431.
13416651047731 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 13416651047731 - 211 = 13416651045683 is a prime.
It is a super-2 number, since 2×134166510477312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13416651047711) 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, 212438751 + ... + 212501896.
It is an arithmetic number, because the mean of its divisors is an integer number (3354269004988).
Almost surely, 213416651047731 is an apocalyptic number.
13416651047731 is a deficient number, since it is larger than the sum of its proper divisors (424972221).
13416651047731 is an equidigital number, since it uses as much as digits as its factorization.
13416651047731 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 424972220.
The product of its (nonzero) digits is 1270080, while the sum is 49.
The spelling of 13416651047731 in words is "thirteen trillion, four hundred sixteen billion, six hundred fifty-one million, forty-seven thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •