Base | Representation |
---|---|
bin | 1011110111010000110001… |
… | …0111110010101011110101 |
3 | 1201011222220101222220111222 |
4 | 2331310030113302223311 |
5 | 3202203124422211321 |
6 | 43424201435240125 |
7 | 2514254025105212 |
oct | 275641427625365 |
9 | 51158811886458 |
10 | 13044023241461 |
11 | 4179a37076683 |
12 | 1568028ba9045 |
13 | 73807a409014 |
14 | 331496a76b09 |
15 | 1794894853ab |
hex | bdd0c5f2af5 |
13044023241461 has 2 divisors, whose sum is σ = 13044023241462. Its totient is φ = 13044023241460.
The previous prime is 13044023241421. The next prime is 13044023241497. The reversal of 13044023241461 is 16414232044031.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12433310688100 + 610712553361 = 3526090^2 + 781481^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13044023241461 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13044023241421) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6522011620730 + 6522011620731.
It is an arithmetic number, because the mean of its divisors is an integer number (6522011620731).
Almost surely, 213044023241461 is an apocalyptic number.
It is an amenable number.
13044023241461 is a deficient number, since it is larger than the sum of its proper divisors (1).
13044023241461 is an equidigital number, since it uses as much as digits as its factorization.
13044023241461 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 55296, while the sum is 35.
Adding to 13044023241461 its reverse (16414232044031), we get a palindrome (29458255285492).
The spelling of 13044023241461 in words is "thirteen trillion, forty-four billion, twenty-three million, two hundred forty-one thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •