Base | Representation |
---|---|
bin | 1110000010010011011… |
… | …1001000010010100111 |
3 | 212001102020001111101202 |
4 | 3200210313020102213 |
5 | 12422321432201411 |
6 | 302435430113115 |
7 | 23264406166052 |
oct | 3404467102247 |
9 | 761366044352 |
10 | 241136600231 |
11 | 932a136287a |
12 | 3a8981ab79b |
13 | 1997b9c8647 |
14 | b9575d7a99 |
15 | 6414b2183b |
hex | 3824dc84a7 |
241136600231 has 4 divisors (see below), whose sum is σ = 241208136264. Its totient is φ = 241065064200.
The previous prime is 241136600129. The next prime is 241136600251. The reversal of 241136600231 is 132006631142.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 241136600231 - 226 = 241069491367 is a prime.
It is a super-2 number, since 2×2411366002312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 241136600194 and 241136600203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (241136600251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35762960 + ... + 35769701.
It is an arithmetic number, because the mean of its divisors is an integer number (60302034066).
Almost surely, 2241136600231 is an apocalyptic number.
241136600231 is a deficient number, since it is larger than the sum of its proper divisors (71536033).
241136600231 is an equidigital number, since it uses as much as digits as its factorization.
241136600231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71536032.
The product of its (nonzero) digits is 5184, while the sum is 29.
The spelling of 241136600231 in words is "two hundred forty-one billion, one hundred thirty-six million, six hundred thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •