Base | Representation |
---|---|
bin | 1101111110011101000… |
… | …1001001011011001111 |
3 | 211221202012121000100220 |
4 | 3133213101021123033 |
5 | 12413212411430411 |
6 | 302145113322423 |
7 | 23226660544221 |
oct | 3374721113317 |
9 | 757665530326 |
10 | 240103233231 |
11 | 92911019964 |
12 | 3a64a106413 |
13 | 198458a7a94 |
14 | b89a282411 |
15 | 63a404db06 |
hex | 37e74496cf |
240103233231 has 4 divisors (see below), whose sum is σ = 320137644312. Its totient is φ = 160068822152.
The previous prime is 240103233229. The next prime is 240103233239. The reversal of 240103233231 is 132332301042.
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 240103233231 - 21 = 240103233229 is a prime.
It is a super-2 number, since 2×2401032332312 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (240103233239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 40017205536 + ... + 40017205541.
It is an arithmetic number, because the mean of its divisors is an integer number (80034411078).
Almost surely, 2240103233231 is an apocalyptic number.
240103233231 is a deficient number, since it is larger than the sum of its proper divisors (80034411081).
240103233231 is an equidigital number, since it uses as much as digits as its factorization.
240103233231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80034411080.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 240103233231 its reverse (132332301042), we get a palindrome (372435534273).
The spelling of 240103233231 in words is "two hundred forty billion, one hundred three million, two hundred thirty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •