Base | Representation |
---|---|
bin | 11110010011011100110… |
… | …00111000100100001101 |
3 | 10200112121101122212102001 |
4 | 33021232120320210031 |
5 | 114024421412240131 |
6 | 2114200352232301 |
7 | 135140515561303 |
oct | 17115630704415 |
9 | 3615541585361 |
10 | 1041234102541 |
11 | 371648562496 |
12 | 14996b23b691 |
13 | 77259c22999 |
14 | 385788a0273 |
15 | 1c141773261 |
hex | f26e63890d |
1041234102541 has 2 divisors, whose sum is σ = 1041234102542. Its totient is φ = 1041234102540.
The previous prime is 1041234102487. The next prime is 1041234102563. The reversal of 1041234102541 is 1452014321401.
It is a happy number.
1041234102541 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 924249581641 + 116984520900 = 961379^2 + 342030^2 .
It is a cyclic number.
It is not a de Polignac number, because 1041234102541 - 211 = 1041234100493 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1041234102241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 520617051270 + 520617051271.
It is an arithmetic number, because the mean of its divisors is an integer number (520617051271).
Almost surely, 21041234102541 is an apocalyptic number.
It is an amenable number.
1041234102541 is a deficient number, since it is larger than the sum of its proper divisors (1).
1041234102541 is an equidigital number, since it uses as much as digits as its factorization.
1041234102541 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3840, while the sum is 28.
Adding to 1041234102541 its reverse (1452014321401), we get a palindrome (2493248423942).
The spelling of 1041234102541 in words is "one trillion, forty-one billion, two hundred thirty-four million, one hundred two thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •