Base | Representation |
---|---|
bin | 110110101001010000110001… |
… | …100010110011110111111011 |
3 | 1011111221022210101201021202122 |
4 | 312221100301202303313323 |
5 | 223000031340413131211 |
6 | 2211050030525551455 |
7 | 101423161652450132 |
oct | 6651206142636773 |
9 | 1144838711637678 |
10 | 240330021223931 |
11 | 6a638431654591 |
12 | 22b55699a1558b |
13 | a41404026b872 |
14 | 434c06c412919 |
15 | 1cbb806d876db |
hex | da94318b3dfb |
240330021223931 has 2 divisors, whose sum is σ = 240330021223932. Its totient is φ = 240330021223930.
The previous prime is 240330021223907. The next prime is 240330021224081. The reversal of 240330021223931 is 139322120033042.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 240330021223931 - 242 = 235931974712827 is a prime.
It is a super-2 number, since 2×2403300212239312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 240330021223891 and 240330021223900.
It is not a weakly prime, because it can be changed into another prime (240330029223931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 120165010611965 + 120165010611966.
It is an arithmetic number, because the mean of its divisors is an integer number (120165010611966).
Almost surely, 2240330021223931 is an apocalyptic number.
240330021223931 is a deficient number, since it is larger than the sum of its proper divisors (1).
240330021223931 is an equidigital number, since it uses as much as digits as its factorization.
240330021223931 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 35.
Adding to 240330021223931 its reverse (139322120033042), we get a palindrome (379652141256973).
The spelling of 240330021223931 in words is "two hundred forty trillion, three hundred thirty billion, twenty-one million, two hundred twenty-three thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •