Base | Representation |
---|---|
bin | 1011110111010111111100… |
… | …1101000110111101011111 |
3 | 1201012011212200012021111002 |
4 | 2331311333031012331133 |
5 | 3202221101123231032 |
6 | 43425120540420515 |
7 | 2514352540545413 |
oct | 275657715067537 |
9 | 51164780167432 |
10 | 13045949820767 |
11 | 417a835626186 |
12 | 156848624773b |
13 | 7382c65b7886 |
14 | 3315da89cd43 |
15 | 17954d693862 |
hex | bdd7f346f5f |
13045949820767 has 2 divisors, whose sum is σ = 13045949820768. Its totient is φ = 13045949820766.
The previous prime is 13045949820749. The next prime is 13045949820791. The reversal of 13045949820767 is 76702894954031.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13045949820767 - 28 = 13045949820511 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13045949820737) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6522974910383 + 6522974910384.
It is an arithmetic number, because the mean of its divisors is an integer number (6522974910384).
It is a 1-persistent number, because it is pandigital, but 2⋅13045949820767 = 26091899641534 is not.
Almost surely, 213045949820767 is an apocalyptic number.
13045949820767 is a deficient number, since it is larger than the sum of its proper divisors (1).
13045949820767 is an equidigital number, since it uses as much as digits as its factorization.
13045949820767 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 91445760, while the sum is 65.
The spelling of 13045949820767 in words is "thirteen trillion, forty-five billion, nine hundred forty-nine million, eight hundred twenty thousand, seven hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •