Base | Representation |
---|---|
bin | 1100110001000000100010… |
… | …0010111011101110101001 |
3 | 1211200211121200212002000010 |
4 | 3030100020202323232221 |
5 | 3314431411200423401 |
6 | 45504032124202133 |
7 | 2646034361464602 |
oct | 314201042735651 |
9 | 54624550762003 |
10 | 14036096498601 |
11 | 452174760a311 |
12 | 16a8358399349 |
13 | 7aa7a13a0968 |
14 | 3674ca444da9 |
15 | 19519ed71ed6 |
hex | cc4088bbba9 |
14036096498601 has 8 divisors (see below), whose sum is σ = 19699784559520. Its totient is φ = 8864903051712.
The previous prime is 14036096498591. The next prime is 14036096498609. The reversal of 14036096498601 is 10689469063041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14036096498601 - 26 = 14036096498537 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (57), and also a Moran number because the ratio is a prime number: 246247306993 = 14036096498601 / (1 + 4 + 0 + 3 + 6 + 0 + 9 + 6 + 4 + 9 + 8 + 6 + 0 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14036096498609) 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, 123123653440 + ... + 123123653553.
It is an arithmetic number, because the mean of its divisors is an integer number (2462473069940).
Almost surely, 214036096498601 is an apocalyptic number.
It is an amenable number.
14036096498601 is a deficient number, since it is larger than the sum of its proper divisors (5663688060919).
14036096498601 is a wasteful number, since it uses less digits than its factorization.
14036096498601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 246247307015.
The product of its (nonzero) digits is 6718464, while the sum is 57.
The spelling of 14036096498601 in words is "fourteen trillion, thirty-six billion, ninety-six million, four hundred ninety-eight thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •