Base | Representation |
---|---|
bin | 1101000110010101101001… |
… | …1001101000101011100001 |
3 | 1212222212110220201222020122 |
4 | 3101211122121220223201 |
5 | 3341432401223410103 |
6 | 50344234135250025 |
7 | 3014356263121460 |
oct | 321453231505341 |
9 | 55885426658218 |
10 | 14402542013153 |
11 | 46530a15470a8 |
12 | 1747386219915 |
13 | 806200111688 |
14 | 37b13009a9d7 |
15 | 19e99aa70b38 |
hex | d195a668ae1 |
14402542013153 has 8 divisors (see below), whose sum is σ = 16463900155008. Its totient is φ = 12342146906304.
The previous prime is 14402542013147. The next prime is 14402542013179. The reversal of 14402542013153 is 35131024520441.
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 14402542013153 - 210 = 14402542012129 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (14402542003153) 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, 240726701 + ... + 240786522.
It is an arithmetic number, because the mean of its divisors is an integer number (2057987519376).
Almost surely, 214402542013153 is an apocalyptic number.
It is an amenable number.
14402542013153 is a deficient number, since it is larger than the sum of its proper divisors (2061358141855).
14402542013153 is an equidigital number, since it uses as much as digits as its factorization.
14402542013153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 481517503.
The product of its (nonzero) digits is 57600, while the sum is 35.
Adding to 14402542013153 its reverse (35131024520441), we get a palindrome (49533566533594).
The spelling of 14402542013153 in words is "fourteen trillion, four hundred two billion, five hundred forty-two million, thirteen thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •