Base | Representation |
---|---|
bin | 1100011111011001111100… |
… | …1010001000110001101111 |
3 | 1210121221000211010202012202 |
4 | 3013312133022020301233 |
5 | 3300003034223230142 |
6 | 45113055451452115 |
7 | 2615140260443366 |
oct | 307663712106157 |
9 | 53557024122182 |
10 | 13733680680047 |
11 | 441546a786859 |
12 | 1659819a5703b |
13 | 788107c08323 |
14 | 3569dc5267dd |
15 | 18c3a0565032 |
hex | c7d9f288c6f |
13733680680047 has 4 divisors (see below), whose sum is σ = 13733738603520. Its totient is φ = 13733622756576.
The previous prime is 13733680680037. The next prime is 13733680680059. The reversal of 13733680680047 is 74008608633731.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13733680680047 - 212 = 13733680675951 is a prime.
It is a super-2 number, since 2×137336806800472 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13733680679974 and 13733680680001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13733680680017) 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, 28604618 + ... + 29080775.
It is an arithmetic number, because the mean of its divisors is an integer number (3433434650880).
Almost surely, 213733680680047 is an apocalyptic number.
13733680680047 is a deficient number, since it is larger than the sum of its proper divisors (57923473).
13733680680047 is an equidigital number, since it uses as much as digits as its factorization.
13733680680047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57923472.
The product of its (nonzero) digits is 12192768, while the sum is 56.
The spelling of 13733680680047 in words is "thirteen trillion, seven hundred thirty-three billion, six hundred eighty million, six hundred eighty thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •