Base | Representation |
---|---|
bin | 1100110000101101110000… |
… | …0000110111111011101001 |
3 | 1211200100121022021012100202 |
4 | 3030023130000313323221 |
5 | 3314341044411432403 |
6 | 45501435530441545 |
7 | 2645465415423356 |
oct | 314133400677351 |
9 | 54610538235322 |
10 | 14031054405353 |
11 | 451a59a471aa7 |
12 | 16a738b8932b5 |
13 | 7aa1798c482b |
14 | 36716c94762d |
15 | 194ea73a3688 |
hex | cc2dc037ee9 |
14031054405353 has 8 divisors (see below), whose sum is σ = 14650946350848. Its totient is φ = 13411982968384.
The previous prime is 14031054405343. The next prime is 14031054405367. The reversal of 14031054405353 is 35350445013041.
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 14031054405353 - 218 = 14031054143209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14031054405343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 205092176 + ... + 205160577.
It is an arithmetic number, because the mean of its divisors is an integer number (1831368293856).
Almost surely, 214031054405353 is an apocalyptic number.
It is an amenable number.
14031054405353 is a deficient number, since it is larger than the sum of its proper divisors (619891945495).
14031054405353 is a wasteful number, since it uses less digits than its factorization.
14031054405353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 410254263.
The product of its (nonzero) digits is 216000, while the sum is 38.
Adding to 14031054405353 its reverse (35350445013041), we get a palindrome (49381499418394).
The spelling of 14031054405353 in words is "fourteen trillion, thirty-one billion, fifty-four million, four hundred five thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •