Base | Representation |
---|---|
bin | 1011111011110111000100… |
… | …0000110000001011101001 |
3 | 1201110112210220102112101111 |
4 | 2332331301000300023221 |
5 | 3210001421401041131 |
6 | 43524344353550321 |
7 | 2523051460656541 |
oct | 276756100601351 |
9 | 51415726375344 |
10 | 13123021112041 |
11 | 41aa495335025 |
12 | 157b3b52753a1 |
13 | 742659a39639 |
14 | 33522c6ac321 |
15 | 17b55e9a1ab1 |
hex | bef710302e9 |
13123021112041 has 2 divisors, whose sum is σ = 13123021112042. Its totient is φ = 13123021112040.
The previous prime is 13123021111973. The next prime is 13123021112177. The reversal of 13123021112041 is 14021112032131.
13123021112041 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13117471458025 + 5549654016 = 3621805^2 + 74496^2 .
It is a cyclic number.
It is not a de Polignac number, because 13123021112041 - 223 = 13123012723433 is a prime.
It is not a weakly prime, because it can be changed into another prime (13123021112441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6561510556020 + 6561510556021.
It is an arithmetic number, because the mean of its divisors is an integer number (6561510556021).
Almost surely, 213123021112041 is an apocalyptic number.
It is an amenable number.
13123021112041 is a deficient number, since it is larger than the sum of its proper divisors (1).
13123021112041 is an equidigital number, since it uses as much as digits as its factorization.
13123021112041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 13123021112041 its reverse (14021112032131), we get a palindrome (27144133144172).
The spelling of 13123021112041 in words is "thirteen trillion, one hundred twenty-three billion, twenty-one million, one hundred twelve thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •