Base | Representation |
---|---|
bin | 1000101000010011… |
… | …1000000100011001 |
3 | 12222102222010022002 |
4 | 2022010320010121 |
5 | 14221013042131 |
6 | 1021511210345 |
7 | 111256133363 |
oct | 21204700431 |
9 | 5872863262 |
10 | 2316534041 |
11 | a89694348 |
12 | 5479769b5 |
13 | 2abc13b03 |
14 | 17d933d33 |
15 | d858a6cb |
hex | 8a138119 |
2316534041 has 2 divisors, whose sum is σ = 2316534042. Its totient is φ = 2316534040.
The previous prime is 2316533983. The next prime is 2316534061. The reversal of 2316534041 is 1404356132.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1936440025 + 380094016 = 44005^2 + 19496^2 .
It is a cyclic number.
It is not a de Polignac number, because 2316534041 - 218 = 2316271897 is a prime.
It is a super-2 number, since 2×23165340412 = 10732659926223579362, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2316533995 and 2316534013.
It is not a weakly prime, because it can be changed into another prime (2316534061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1158267020 + 1158267021.
It is an arithmetic number, because the mean of its divisors is an integer number (1158267021).
Almost surely, 22316534041 is an apocalyptic number.
It is an amenable number.
2316534041 is a deficient number, since it is larger than the sum of its proper divisors (1).
2316534041 is an equidigital number, since it uses as much as digits as its factorization.
2316534041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8640, while the sum is 29.
The square root of 2316534041 is about 48130.3858388856. The cubic root of 2316534041 is about 1323.1616211048.
The spelling of 2316534041 in words is "two billion, three hundred sixteen million, five hundred thirty-four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •