Base | Representation |
---|---|
bin | 1010111110011011111100… |
… | …1010011000101010000111 |
3 | 1120201200000122212022100122 |
4 | 2233212333022120222013 |
5 | 3040204243144231114 |
6 | 41355505050532155 |
7 | 2353603412055062 |
oct | 257467712305207 |
9 | 46650018768318 |
10 | 12067770305159 |
11 | 3932a04805168 |
12 | 142a993a3705b |
13 | 696ca7c0977a |
14 | 2da1244278d9 |
15 | 15dd9c8eae8e |
hex | af9bf298a87 |
12067770305159 has 2 divisors, whose sum is σ = 12067770305160. Its totient is φ = 12067770305158.
The previous prime is 12067770305147. The next prime is 12067770305207. The reversal of 12067770305159 is 95150307776021.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (95150307776021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12067770305159 - 224 = 12067753527943 is a prime.
It is a super-4 number, since 4×120677703051594 (a number of 53 digits) contains 4444 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12067770305159.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12067770305359) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6033885152579 + 6033885152580.
It is an arithmetic number, because the mean of its divisors is an integer number (6033885152580).
Almost surely, 212067770305159 is an apocalyptic number.
12067770305159 is a deficient number, since it is larger than the sum of its proper divisors (1).
12067770305159 is an equidigital number, since it uses as much as digits as its factorization.
12067770305159 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2778300, while the sum is 53.
The spelling of 12067770305159 in words is "twelve trillion, sixty-seven billion, seven hundred seventy million, three hundred five thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •