Base | Representation |
---|---|
bin | 1101101111010100101… |
… | …1010000000011011001 |
3 | 211120021010220201201110 |
4 | 3123311023100003121 |
5 | 12331403122214431 |
6 | 300234102410533 |
7 | 23024221335435 |
oct | 3336513200331 |
9 | 746233821643 |
10 | 236041601241 |
11 | 9111736a706 |
12 | 398b5a30a49 |
13 | 19349287644 |
14 | b5d2a879c5 |
15 | 62176a2346 |
hex | 36f52d00d9 |
236041601241 has 16 divisors (see below), whose sum is σ = 333272880000. Its totient is φ = 148087788288.
The previous prime is 236041601219. The next prime is 236041601297. The reversal of 236041601241 is 142106140632.
236041601241 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 236041601241 - 27 = 236041601113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 236041601199 and 236041601208.
It is not an unprimeable number, because it can be changed into a prime (236041601041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 201795 + ... + 716103.
It is an arithmetic number, because the mean of its divisors is an integer number (20829555000).
Almost surely, 2236041601241 is an apocalyptic number.
It is an amenable number.
236041601241 is a deficient number, since it is larger than the sum of its proper divisors (97231278759).
236041601241 is a wasteful number, since it uses less digits than its factorization.
236041601241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 523328.
The product of its (nonzero) digits is 6912, while the sum is 30.
Adding to 236041601241 its reverse (142106140632), we get a palindrome (378147741873).
The spelling of 236041601241 in words is "two hundred thirty-six billion, forty-one million, six hundred one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •