Base | Representation |
---|---|
bin | 1101101111100011110… |
… | …1010001011111111101 |
3 | 211120102120022001120211 |
4 | 3123320331101133331 |
5 | 12332020342433023 |
6 | 300244250312421 |
7 | 23025621530554 |
oct | 3337075213775 |
9 | 746376261524 |
10 | 236105046013 |
11 | 9114a163701 |
12 | 39913128711 |
13 | 1935946c525 |
14 | b5db280d9b |
15 | 621d035a0d |
hex | 36f8f517fd |
236105046013 has 2 divisors, whose sum is σ = 236105046014. Its totient is φ = 236105046012.
The previous prime is 236105045971. The next prime is 236105046031. The reversal of 236105046013 is 310640501632.
Together with next prime (236105046031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 230758219129 + 5346826884 = 480373^2 + 73122^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-236105046013 is a prime.
It is a super-4 number, since 4×2361050460134 (a number of 47 digits) contains 4444 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (236105046083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 118052523006 + 118052523007.
It is an arithmetic number, because the mean of its divisors is an integer number (118052523007).
Almost surely, 2236105046013 is an apocalyptic number.
It is an amenable number.
236105046013 is a deficient number, since it is larger than the sum of its proper divisors (1).
236105046013 is an equidigital number, since it uses as much as digits as its factorization.
236105046013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12960, while the sum is 31.
Adding to 236105046013 its reverse (310640501632), we get a palindrome (546745547645).
The spelling of 236105046013 in words is "two hundred thirty-six billion, one hundred five million, forty-six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •