Base | Representation |
---|---|
bin | 11000100111010111110… |
… | …101101001001001000001 |
3 | 12222201011120011111200001 |
4 | 120213113311221021001 |
5 | 210203240041422123 |
6 | 3333030111400001 |
7 | 233132006623231 |
oct | 30472765511101 |
9 | 5881146144601 |
10 | 1691543310913 |
11 | 5a241a111945 |
12 | 2339ba523001 |
13 | c36866c3131 |
14 | 5bc2a563cc1 |
15 | 2e0031b30ad |
hex | 189d7d69241 |
1691543310913 has 8 divisors (see below), whose sum is σ = 1715210346240. Its totient is φ = 1667979852000.
The previous prime is 1691543310901. The next prime is 1691543310937. The reversal of 1691543310913 is 3190133451961.
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 1691543310913 - 217 = 1691543179841 is a prime.
It is a super-2 number, since 2×16915433109132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1691543310013) 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, 25861213 + ... + 25926538.
It is an arithmetic number, because the mean of its divisors is an integer number (214401293280).
Almost surely, 21691543310913 is an apocalyptic number.
It is an amenable number.
1691543310913 is a deficient number, since it is larger than the sum of its proper divisors (23667035327).
1691543310913 is an equidigital number, since it uses as much as digits as its factorization.
1691543310913 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51788207.
The product of its (nonzero) digits is 262440, while the sum is 46.
The spelling of 1691543310913 in words is "one trillion, six hundred ninety-one billion, five hundred forty-three million, three hundred ten thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •