Base | Representation |
---|---|
bin | 1100000001001011100011… |
… | …1101000111110100010001 |
3 | 1201210021201211010201112121 |
4 | 3000102320331013310101 |
5 | 3213001114120324131 |
6 | 44034342153254241 |
7 | 2532465464250214 |
oct | 300227075076421 |
9 | 51707654121477 |
10 | 13214422433041 |
11 | 4235228a67345 |
12 | 1595063404381 |
13 | 74b164c8072b |
14 | 33981d74377b |
15 | 17db0dd84911 |
hex | c04b8f47d11 |
13214422433041 has 8 divisors (see below), whose sum is σ = 13283578016064. Its totient is φ = 13145362835280.
The previous prime is 13214422433027. The next prime is 13214422433083. The reversal of 13214422433041 is 14033422441231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13214422433041 - 29 = 13214422432529 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13214422432988 and 13214422433006.
It is not an unprimeable number, because it can be changed into a prime (13214422433021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23720245 + ... + 24270946.
It is an arithmetic number, because the mean of its divisors is an integer number (1660447252008).
Almost surely, 213214422433041 is an apocalyptic number.
It is an amenable number.
13214422433041 is a deficient number, since it is larger than the sum of its proper divisors (69155583023).
13214422433041 is a wasteful number, since it uses less digits than its factorization.
13214422433041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47992631.
The product of its (nonzero) digits is 55296, while the sum is 34.
Adding to 13214422433041 its reverse (14033422441231), we get a palindrome (27247844874272).
The spelling of 13214422433041 in words is "thirteen trillion, two hundred fourteen billion, four hundred twenty-two million, four hundred thirty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •