Base | Representation |
---|---|
bin | 1101000001110101111110… |
… | …1100110101010001010101 |
3 | 1212201111011021202111010121 |
4 | 3100131133230311101111 |
5 | 3334201224302121323 |
6 | 50244543432151541 |
7 | 3005653551554134 |
oct | 320353754652125 |
9 | 55644137674117 |
10 | 14325321520213 |
11 | 46233755a08a0 |
12 | 17344152385b1 |
13 | 7cbb44ab01c2 |
14 | 3774c652d91b |
15 | 19c97b5dea5d |
hex | d075fb35455 |
14325321520213 has 4 divisors (see below), whose sum is σ = 15627623476608. Its totient is φ = 13023019563820.
The previous prime is 14325321520207. The next prime is 14325321520229. The reversal of 14325321520213 is 31202512352341.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14325321520213 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14325321520613) 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, 651150978181 + ... + 651150978202.
It is an arithmetic number, because the mean of its divisors is an integer number (3906905869152).
Almost surely, 214325321520213 is an apocalyptic number.
It is an amenable number.
14325321520213 is a deficient number, since it is larger than the sum of its proper divisors (1302301956395).
14325321520213 is a wasteful number, since it uses less digits than its factorization.
14325321520213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1302301956394.
The product of its (nonzero) digits is 43200, while the sum is 34.
Adding to 14325321520213 its reverse (31202512352341), we get a palindrome (45527833872554).
The spelling of 14325321520213 in words is "fourteen trillion, three hundred twenty-five billion, three hundred twenty-one million, five hundred twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •