Base | Representation |
---|---|
bin | 1011011000001011110101… |
… | …0101100001010111000001 |
3 | 1122021221210212022012110022 |
4 | 2312002331111201113001 |
5 | 3114431212023121231 |
6 | 42335023111543225 |
7 | 2430553316355341 |
oct | 266027525412701 |
9 | 48257725265408 |
10 | 12510121301441 |
11 | 3a93570377935 |
12 | 14a066638ab15 |
13 | 6c99126b920a |
14 | 3136c90dcd21 |
15 | 16a63c3c2c7b |
hex | b60bd5615c1 |
12510121301441 has 2 divisors, whose sum is σ = 12510121301442. Its totient is φ = 12510121301440.
The previous prime is 12510121301417. The next prime is 12510121301449. The reversal of 12510121301441 is 14410312101521.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10887756115600 + 1622365185841 = 3299660^2 + 1273721^2 .
It is a cyclic number.
It is not a de Polignac number, because 12510121301441 - 226 = 12510054192577 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12510121301441.
It is not a weakly prime, because it can be changed into another prime (12510121301449) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6255060650720 + 6255060650721.
It is an arithmetic number, because the mean of its divisors is an integer number (6255060650721).
Almost surely, 212510121301441 is an apocalyptic number.
It is an amenable number.
12510121301441 is a deficient number, since it is larger than the sum of its proper divisors (1).
12510121301441 is an equidigital number, since it uses as much as digits as its factorization.
12510121301441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 960, while the sum is 26.
Adding to 12510121301441 its reverse (14410312101521), we get a palindrome (26920433402962).
The spelling of 12510121301441 in words is "twelve trillion, five hundred ten billion, one hundred twenty-one million, three hundred one thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •