Base | Representation |
---|---|
bin | 1101001001001111000010… |
… | …1000000101010111111001 |
3 | 1220011121221010101102110120 |
4 | 3102103300220011113321 |
5 | 3343241311044221403 |
6 | 50423144224203453 |
7 | 3021100432536663 |
oct | 322236050052771 |
9 | 56147833342416 |
10 | 14452307023353 |
11 | 46722095a8901 |
12 | 1754b54469589 |
13 | 80ab01295b84 |
14 | 37d6d14db533 |
15 | 1a0e0e998e53 |
hex | d24f0a055f9 |
14452307023353 has 4 divisors (see below), whose sum is σ = 19269742697808. Its totient is φ = 9634871348900.
The previous prime is 14452307023279. The next prime is 14452307023361. The reversal of 14452307023353 is 35332070325441.
It is a happy number.
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 14452307023353 - 218 = 14452306761209 is a prime.
It is not an unprimeable number, because it can be changed into a prime (14452307023393) 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, 2408717837223 + ... + 2408717837228.
It is an arithmetic number, because the mean of its divisors is an integer number (4817435674452).
Almost surely, 214452307023353 is an apocalyptic number.
It is an amenable number.
14452307023353 is a deficient number, since it is larger than the sum of its proper divisors (4817435674455).
14452307023353 is an equidigital number, since it uses as much as digits as its factorization.
14452307023353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4817435674454.
The product of its (nonzero) digits is 907200, while the sum is 42.
Adding to 14452307023353 its reverse (35332070325441), we get a palindrome (49784377348794).
The spelling of 14452307023353 in words is "fourteen trillion, four hundred fifty-two billion, three hundred seven million, twenty-three thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •