Base | Representation |
---|---|
bin | 110110100100111011100000… |
… | …101100110000011001101111 |
3 | 1011110212212100112112111210010 |
4 | 312210323200230300121233 |
5 | 222430142133401230411 |
6 | 2210301153310544303 |
7 | 101362522313104362 |
oct | 6644734054603157 |
9 | 1143785315474703 |
10 | 240032312133231 |
11 | 6a53314a62a362 |
12 | 22b07a53808093 |
13 | a3c1c46c513b7 |
14 | 433b8a96540d9 |
15 | 1cb3bd08a17a6 |
hex | da4ee0b3066f |
240032312133231 has 32 divisors (see below), whose sum is σ = 344346031180800. Its totient is φ = 148702072022400.
The previous prime is 240032312133167. The next prime is 240032312133233. The reversal of 240032312133231 is 132331213230042.
It is not a de Polignac number, because 240032312133231 - 26 = 240032312133167 is a prime.
It is a super-2 number, since 2×2400323121332312 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (240032312133233) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 101908545 + ... + 104237306.
It is an arithmetic number, because the mean of its divisors is an integer number (10760813474400).
Almost surely, 2240032312133231 is an apocalyptic number.
240032312133231 is a deficient number, since it is larger than the sum of its proper divisors (104313719047569).
240032312133231 is an equidigital number, since it uses as much as digits as its factorization.
240032312133231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206145984 (or 206145950 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 30.
Adding to 240032312133231 its reverse (132331213230042), we get a palindrome (372363525363273).
The spelling of 240032312133231 in words is "two hundred forty trillion, thirty-two billion, three hundred twelve million, one hundred thirty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •