Base | Representation |
---|---|
bin | 1011011111110101001010… |
… | …1001010001101010001111 |
3 | 1122202111212011000220111222 |
4 | 2313331102221101222033 |
5 | 3124104220134212304 |
6 | 42515225200033555 |
7 | 2443213354101266 |
oct | 267752251215217 |
9 | 48674764026458 |
10 | 12641475304079 |
11 | 4034246279206 |
12 | 15020046028bb |
13 | 709116c55c2b |
14 | 319bca3455dd |
15 | 16dc790424be |
hex | b7f52a51a8f |
12641475304079 has 2 divisors, whose sum is σ = 12641475304080. Its totient is φ = 12641475304078.
The previous prime is 12641475304057. The next prime is 12641475304097. The reversal of 12641475304079 is 97040357414621.
Together with next prime (12641475304097) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is an emirp because it is prime and its reverse (97040357414621) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12641475304079 - 212 = 12641475299983 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12641475304079.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12641475304019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6320737652039 + 6320737652040.
It is an arithmetic number, because the mean of its divisors is an integer number (6320737652040).
Almost surely, 212641475304079 is an apocalyptic number.
12641475304079 is a deficient number, since it is larger than the sum of its proper divisors (1).
12641475304079 is an equidigital number, since it uses as much as digits as its factorization.
12641475304079 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5080320, while the sum is 53.
The spelling of 12641475304079 in words is "twelve trillion, six hundred forty-one billion, four hundred seventy-five million, three hundred four thousand, seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •