Base | Representation |
---|---|
bin | 1011010011001000110110… |
… | …1111000001011011010101 |
3 | 1121222200000201210010120220 |
4 | 2310302031233001123111 |
5 | 3112021132333142401 |
6 | 42231124125344553 |
7 | 2421364003661223 |
oct | 264621557013325 |
9 | 47880021703526 |
10 | 12423423334101 |
11 | 3a5a82065985a |
12 | 14878ab408159 |
13 | 6c16a6a0b520 |
14 | 30d422989b13 |
15 | 168265d9b336 |
hex | b4c8dbc16d5 |
12423423334101 has 8 divisors (see below), whose sum is σ = 17838761710560. Its totient is φ = 7645183590192.
The previous prime is 12423423334087. The next prime is 12423423334109. The reversal of 12423423334101 is 10143332432421.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12423423334101 - 231 = 12421275850453 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12423423334109) 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 7 ways as a sum of consecutive naturals, for example, 159274658091 + ... + 159274658168.
It is an arithmetic number, because the mean of its divisors is an integer number (2229845213820).
Almost surely, 212423423334101 is an apocalyptic number.
It is an amenable number.
12423423334101 is a deficient number, since it is larger than the sum of its proper divisors (5415338376459).
12423423334101 is a wasteful number, since it uses less digits than its factorization.
12423423334101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 318549316275.
The product of its (nonzero) digits is 41472, while the sum is 33.
Adding to 12423423334101 its reverse (10143332432421), we get a palindrome (22566755766522).
The spelling of 12423423334101 in words is "twelve trillion, four hundred twenty-three billion, four hundred twenty-three million, three hundred thirty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •