Base | Representation |
---|---|
bin | 1011110000011000111001… |
… | …0010111011100101000001 |
3 | 1200202201010020220220222022 |
4 | 2330012032102323211001 |
5 | 3143234313120432321 |
6 | 43254032513451225 |
7 | 2502603640331411 |
oct | 274061622734501 |
9 | 50681106826868 |
10 | 12925943920961 |
11 | 4133953401495 |
12 | 1549174570b15 |
13 | 729bb0115cc6 |
14 | 32989485c641 |
15 | 176377e24dab |
hex | bc18e4bb941 |
12925943920961 has 2 divisors, whose sum is σ = 12925943920962. Its totient is φ = 12925943920960.
The previous prime is 12925943920949. The next prime is 12925943920973. The reversal of 12925943920961 is 16902934952921.
It is a balanced prime because it is at equal distance from previous prime (12925943920949) and next prime (12925943920973).
It can be written as a sum of positive squares in only one way, i.e., 7792366173361 + 5133577747600 = 2791481^2 + 2265740^2 .
It is a cyclic number.
It is not a de Polignac number, because 12925943920961 - 222 = 12925939726657 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12925943920894 and 12925943920903.
It is not a weakly prime, because it can be changed into another prime (12925943920661) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6462971960480 + 6462971960481.
It is an arithmetic number, because the mean of its divisors is an integer number (6462971960481).
Almost surely, 212925943920961 is an apocalyptic number.
It is an amenable number.
12925943920961 is a deficient number, since it is larger than the sum of its proper divisors (1).
12925943920961 is an equidigital number, since it uses as much as digits as its factorization.
12925943920961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18895680, while the sum is 62.
The spelling of 12925943920961 in words is "twelve trillion, nine hundred twenty-five billion, nine hundred forty-three million, nine hundred twenty thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •