Base | Representation |
---|---|
bin | 100110101010010101… |
… | …010101011010011001 |
3 | 10222011001221200201102 |
4 | 212222111111122121 |
5 | 1140004140100423 |
6 | 31023123201145 |
7 | 2666500535315 |
oct | 465225253231 |
9 | 128131850642 |
10 | 41512425113 |
11 | 16672755455 |
12 | 80665161b5 |
13 | 3bb7505173 |
14 | 201b3c6b45 |
15 | 112e687c28 |
hex | 9aa555699 |
41512425113 has 2 divisors, whose sum is σ = 41512425114. Its totient is φ = 41512425112.
The previous prime is 41512425109. The next prime is 41512425131. The reversal of 41512425113 is 31152421514.
It is a happy number.
41512425113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with next prime (41512425131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 27666666889 + 13845758224 = 166333^2 + 117668^2 .
It is a cyclic number.
It is not a de Polignac number, because 41512425113 - 22 = 41512425109 is a prime.
It is not a weakly prime, because it can be changed into another prime (41512425313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20756212556 + 20756212557.
It is an arithmetic number, because the mean of its divisors is an integer number (20756212557).
Almost surely, 241512425113 is an apocalyptic number.
It is an amenable number.
41512425113 is a deficient number, since it is larger than the sum of its proper divisors (1).
41512425113 is an equidigital number, since it uses as much as digits as its factorization.
41512425113 is an evil number, because the sum of its binary digits is even.
The product of its digits is 4800, while the sum is 29.
Adding to 41512425113 its reverse (31152421514), we get a palindrome (72664846627).
The spelling of 41512425113 in words is "forty-one billion, five hundred twelve million, four hundred twenty-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •