Base | Representation |
---|---|
bin | 1011001101110101001001… |
… | …1100001100111001111111 |
3 | 1121122221122121101202020122 |
4 | 2303131102130030321333 |
5 | 3104022403430401143 |
6 | 42121203350405155 |
7 | 2411655155254061 |
oct | 263352234147177 |
9 | 47587577352218 |
10 | 12332234231423 |
11 | 3a250867a5287 |
12 | 14720a03607bb |
13 | 6b5c0373bbc2 |
14 | 308c51b97731 |
15 | 165bca437c68 |
hex | b375270ce7f |
12332234231423 has 4 divisors (see below), whose sum is σ = 12332520824040. Its totient is φ = 12331947638808.
The previous prime is 12332234231417. The next prime is 12332234231467. The reversal of 12332234231423 is 32413243223321.
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 12332234231423 - 232 = 12327939264127 is a prime.
It is a super-2 number, since 2×123322342314232 (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 (12332234231123) 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, 143231753 + ... + 143317826.
It is an arithmetic number, because the mean of its divisors is an integer number (3083130206010).
Almost surely, 212332234231423 is an apocalyptic number.
12332234231423 is a deficient number, since it is larger than the sum of its proper divisors (286592617).
12332234231423 is an equidigital number, since it uses as much as digits as its factorization.
12332234231423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 286592616.
The product of its digits is 124416, while the sum is 35.
Adding to 12332234231423 its reverse (32413243223321), we get a palindrome (44745477454744).
The spelling of 12332234231423 in words is "twelve trillion, three hundred thirty-two billion, two hundred thirty-four million, two hundred thirty-one thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •