Base | Representation |
---|---|
bin | 1000010101010001… |
… | …1111010101001101 |
3 | 12202212211012202002 |
4 | 2011110133111031 |
5 | 14040101202231 |
6 | 1005541042045 |
7 | 106266661421 |
oct | 20524372515 |
9 | 5685735662 |
10 | 2236740941 |
11 | a48644636 |
12 | 5250b6325 |
13 | 298526966 |
14 | 1730c2b81 |
15 | d15780cb |
hex | 8551f54d |
2236740941 has 2 divisors, whose sum is σ = 2236740942. Its totient is φ = 2236740940.
The previous prime is 2236740911. The next prime is 2236740953. The reversal of 2236740941 is 1490476322.
2236740941 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., 2127976900 + 108764041 = 46130^2 + 10429^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2236740941 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2236740895 and 2236740904.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2236740911) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1118370470 + 1118370471.
It is an arithmetic number, because the mean of its divisors is an integer number (1118370471).
Almost surely, 22236740941 is an apocalyptic number.
It is an amenable number.
2236740941 is a deficient number, since it is larger than the sum of its proper divisors (1).
2236740941 is an equidigital number, since it uses as much as digits as its factorization.
2236740941 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72576, while the sum is 38.
The square root of 2236740941 is about 47294.1956375198. The cubic root of 2236740941 is about 1307.7916566679.
The spelling of 2236740941 in words is "two billion, two hundred thirty-six million, seven hundred forty thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •