Base | Representation |
---|---|
bin | 1101000011100100101100… |
… | …0111101010011110111101 |
3 | 1212211022212111012122212002 |
4 | 3100321023013222132331 |
5 | 3340143110444102303 |
6 | 50310340443552045 |
7 | 3011055204160643 |
oct | 320711307523675 |
9 | 55738774178762 |
10 | 14355041003453 |
11 | 4634a36458497 |
12 | 173a12a22b625 |
13 | 8018a0009647 |
14 | 378b055d7193 |
15 | 19d61a7a7788 |
hex | d0e4b1ea7bd |
14355041003453 has 4 divisors (see below), whose sum is σ = 14688879166368. Its totient is φ = 14021202840540.
The previous prime is 14355041003447. The next prime is 14355041003461. The reversal of 14355041003453 is 35430014055341.
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 not a de Polignac number, because 14355041003453 - 214 = 14355040987069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14355041002453) 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, 166919081393 + ... + 166919081478.
It is an arithmetic number, because the mean of its divisors is an integer number (3672219791592).
Almost surely, 214355041003453 is an apocalyptic number.
It is an amenable number.
14355041003453 is a deficient number, since it is larger than the sum of its proper divisors (333838162915).
14355041003453 is an equidigital number, since it uses as much as digits as its factorization.
14355041003453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 333838162914.
The product of its (nonzero) digits is 216000, while the sum is 38.
Adding to 14355041003453 its reverse (35430014055341), we get a palindrome (49785055058794).
The spelling of 14355041003453 in words is "fourteen trillion, three hundred fifty-five billion, forty-one million, three thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •