Base | Representation |
---|---|
bin | 100110011000100001… |
… | …000100111000010001 |
3 | 10221101020111101201001 |
4 | 212120201010320101 |
5 | 1133401124410413 |
6 | 30533324342001 |
7 | 2656211040154 |
oct | 463041047021 |
9 | 127336441631 |
10 | 41213513233 |
11 | 16529a54542 |
12 | 7ba23a4901 |
13 | 3b6a5c8729 |
14 | 1dcd817c9b |
15 | 11132e14dd |
hex | 998844e11 |
41213513233 has 2 divisors, whose sum is σ = 41213513234. Its totient is φ = 41213513232.
The previous prime is 41213513227. The next prime is 41213513261. The reversal of 41213513233 is 33231531214.
It is an a-pointer prime, because the next prime (41213513261) can be obtained adding 41213513233 to its sum of digits (28).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 39645986769 + 1567526464 = 199113^2 + 39592^2 .
It is a cyclic number.
It is not a de Polignac number, because 41213513233 - 213 = 41213505041 is a prime.
It is a super-2 number, since 2×412135132332 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (41213513293) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20606756616 + 20606756617.
It is an arithmetic number, because the mean of its divisors is an integer number (20606756617).
Almost surely, 241213513233 is an apocalyptic number.
It is an amenable number.
41213513233 is a deficient number, since it is larger than the sum of its proper divisors (1).
41213513233 is an equidigital number, since it uses as much as digits as its factorization.
41213513233 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6480, while the sum is 28.
The spelling of 41213513233 in words is "forty-one billion, two hundred thirteen million, five hundred thirteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •