Base | Representation |
---|---|
bin | 1101100100000101111011… |
… | …0111001000000100000001 |
3 | 1221210201220122110122202001 |
4 | 3121001132313020010001 |
5 | 3423321243244222321 |
6 | 51415133434024001 |
7 | 3066323556024301 |
oct | 331013667100401 |
9 | 57721818418661 |
10 | 14913717960961 |
11 | 482a965a975a6 |
12 | 180a465b78001 |
13 | 84248576c401 |
14 | 397b836b1601 |
15 | 1ace178eac91 |
hex | d905edc8101 |
14913717960961 has 4 divisors (see below), whose sum is σ = 14958774511024. Its totient is φ = 14868661410900.
The previous prime is 14913717960923. The next prime is 14913717960979. The reversal of 14913717960961 is 16906971731941.
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 14913717960961 - 213 = 14913717952769 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14913717960893 and 14913717960902.
It is not an unprimeable number, because it can be changed into a prime (14913717960461) 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, 22528274535 + ... + 22528275196.
It is an arithmetic number, because the mean of its divisors is an integer number (3739693627756).
Almost surely, 214913717960961 is an apocalyptic number.
It is an amenable number.
14913717960961 is a deficient number, since it is larger than the sum of its proper divisors (45056550063).
14913717960961 is an equidigital number, since it uses as much as digits as its factorization.
14913717960961 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45056550062.
The product of its (nonzero) digits is 15431472, while the sum is 64.
The spelling of 14913717960961 in words is "fourteen trillion, nine hundred thirteen billion, seven hundred seventeen million, nine hundred sixty thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •