Base | Representation |
---|---|
bin | 1011001000011110011010… |
… | …1100110110010111101111 |
3 | 1121100011011211121120111111 |
4 | 2302013212230312113233 |
5 | 3101020443434434043 |
6 | 42011030214532451 |
7 | 2402220240152146 |
oct | 262074654662757 |
9 | 47304154546444 |
10 | 12240232343023 |
11 | 399a065067873 |
12 | 14582a5067127 |
13 | 6aa330c60b99 |
14 | 30460506c75d |
15 | 1635e347409d |
hex | b21e6b365ef |
12240232343023 has 4 divisors (see below), whose sum is σ = 12240394534368. Its totient is φ = 12240070151680.
The previous prime is 12240232343011. The next prime is 12240232343033. The reversal of 12240232343023 is 32034323204221.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12240232343023 is a prime.
It is a super-2 number, since 2×122402323430232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12240232343033) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 80982418 + ... + 81133423.
It is an arithmetic number, because the mean of its divisors is an integer number (3060098633592).
Almost surely, 212240232343023 is an apocalyptic number.
12240232343023 is a deficient number, since it is larger than the sum of its proper divisors (162191345).
12240232343023 is an equidigital number, since it uses as much as digits as its factorization.
12240232343023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 162191344.
The product of its (nonzero) digits is 41472, while the sum is 31.
Adding to 12240232343023 its reverse (32034323204221), we get a palindrome (44274555547244).
The spelling of 12240232343023 in words is "twelve trillion, two hundred forty billion, two hundred thirty-two million, three hundred forty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •