Base | Representation |
---|---|
bin | 1101000111101001100101… |
… | …1001000111011100000001 |
3 | 1220002000122012001010220002 |
4 | 3101322121121013130001 |
5 | 3342320022330144311 |
6 | 50402442023125345 |
7 | 3016114526115623 |
oct | 321723131073401 |
9 | 56060565033802 |
10 | 14425073678081 |
11 | 4661704037490 |
12 | 174b813ba3855 |
13 | 8083811544a1 |
14 | 37c26a6b6c13 |
15 | 1a0368bbe93b |
hex | d1e99647701 |
14425073678081 has 8 divisors (see below), whose sum is σ = 15913257991200. Its totient is φ = 12966358361440.
The previous prime is 14425073678023. The next prime is 14425073678101. The reversal of 14425073678081 is 18087637052441.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14425073678081 - 26 = 14425073678017 is a prime.
It is a super-2 number, since 2×144250736780812 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14425073671081) 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, 7367248091 + ... + 7367250048.
It is an arithmetic number, because the mean of its divisors is an integer number (1989157248900).
Almost surely, 214425073678081 is an apocalyptic number.
14425073678081 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
14425073678081 is a deficient number, since it is larger than the sum of its proper divisors (1488184313119).
14425073678081 is a wasteful number, since it uses less digits than its factorization.
14425073678081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14734498239.
The product of its (nonzero) digits is 9031680, while the sum is 56.
The spelling of 14425073678081 in words is "fourteen trillion, four hundred twenty-five billion, seventy-three million, six hundred seventy-eight thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •