Base | Representation |
---|---|
bin | 10011011101110011010… |
… | …110101110100010100101 |
3 | 11201212202112102012021011 |
4 | 103131303112232202211 |
5 | 133404022030313233 |
6 | 2502303414022221 |
7 | 165433466545300 |
oct | 23356326564245 |
9 | 4655675365234 |
10 | 1337670166693 |
11 | 476336a32a63 |
12 | 1972bb047971 |
13 | 991ac58a6c3 |
14 | 48a5a55db37 |
15 | 24be10e60cd |
hex | 137735ae8a5 |
1337670166693 has 12 divisors (see below), whose sum is σ = 1577981712672. Its totient is φ = 1130425490040.
The previous prime is 1337670166687. The next prime is 1337670166727. The reversal of 1337670166693 is 3966610767331.
It is a de Polignac number, because none of the positive numbers 2k-1337670166693 is a prime.
It is a super-2 number, since 2×13376701666932 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1337670166663) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 192245755 + ... + 192252712.
It is an arithmetic number, because the mean of its divisors is an integer number (131498476056).
Almost surely, 21337670166693 is an apocalyptic number.
It is an amenable number.
1337670166693 is a deficient number, since it is larger than the sum of its proper divisors (240311545979).
1337670166693 is an equidigital number, since it uses as much as digits as its factorization.
1337670166693 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 384498552 (or 384498545 counting only the distinct ones).
The product of its (nonzero) digits is 15431472, while the sum is 58.
The spelling of 1337670166693 in words is "one trillion, three hundred thirty-seven billion, six hundred seventy million, one hundred sixty-six thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •