Base | Representation |
---|---|
bin | 10010110000000101000101… |
… | …00111011111011101001011 |
3 | 12101222222020020012212001122 |
4 | 21120002202213133131023 |
5 | 20401041040030144201 |
6 | 223410454534505455 |
7 | 11454042140354564 |
oct | 1130024247373513 |
9 | 171888206185048 |
10 | 41234414303051 |
11 | 12158464993432 |
12 | 475b609b0528b |
13 | 1a015089478a8 |
14 | a27a8340b16b |
15 | 4b7905d42e1b |
hex | 2580a29df74b |
41234414303051 has 2 divisors, whose sum is σ = 41234414303052. Its totient is φ = 41234414303050.
The previous prime is 41234414303023. The next prime is 41234414303101. The reversal of 41234414303051 is 15030341443214.
41234414303051 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 is a cyclic number.
It is not a de Polignac number, because 41234414303051 - 222 = 41234410108747 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (41234414303021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20617207151525 + 20617207151526.
It is an arithmetic number, because the mean of its divisors is an integer number (20617207151526).
Almost surely, 241234414303051 is an apocalyptic number.
41234414303051 is a deficient number, since it is larger than the sum of its proper divisors (1).
41234414303051 is an equidigital number, since it uses as much as digits as its factorization.
41234414303051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 69120, while the sum is 35.
Adding to 41234414303051 its reverse (15030341443214), we get a palindrome (56264755746265).
The spelling of 41234414303051 in words is "forty-one trillion, two hundred thirty-four billion, four hundred fourteen million, three hundred three thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •