Base | Representation |
---|---|
bin | 11110101010010011100… |
… | …11111000000000100001 |
3 | 10201201021121010110100012 |
4 | 33111021303320000201 |
5 | 114230034330314131 |
6 | 2123550151134305 |
7 | 136053562331333 |
oct | 17251163700041 |
9 | 3651247113305 |
10 | 1053505323041 |
11 | 376875321036 |
12 | 150214974395 |
13 | 784643199c2 |
14 | 38dc051d453 |
15 | 1c60dc1a52b |
hex | f549cf8021 |
1053505323041 has 2 divisors, whose sum is σ = 1053505323042. Its totient is φ = 1053505323040.
The previous prime is 1053505323023. The next prime is 1053505323071. The reversal of 1053505323041 is 1403235053501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 806368080400 + 247137242641 = 897980^2 + 497129^2 .
It is an emirp because it is prime and its reverse (1403235053501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1053505323041 - 222 = 1053501128737 is a prime.
It is a super-2 number, since 2×10535053230412 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1053505322989 and 1053505323007.
It is not a weakly prime, because it can be changed into another prime (1053505323071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 526752661520 + 526752661521.
It is an arithmetic number, because the mean of its divisors is an integer number (526752661521).
Almost surely, 21053505323041 is an apocalyptic number.
It is an amenable number.
1053505323041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1053505323041 is an equidigital number, since it uses as much as digits as its factorization.
1053505323041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27000, while the sum is 32.
The spelling of 1053505323041 in words is "one trillion, fifty-three billion, five hundred five million, three hundred twenty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •