Base | Representation |
---|---|
bin | 1010101001101101100000… |
… | …00110101101001110100111 |
3 | 10001221020220210122000011220 |
4 | 11110312300012231032213 |
5 | 11032232121232310343 |
6 | 121452322213231423 |
7 | 4635166652142660 |
oct | 524666006551647 |
9 | 101836823560156 |
10 | 23423411213223 |
11 | 75108a3a8a10a |
12 | 2763745032573 |
13 | 100ba8377a558 |
14 | 5ad9b0688367 |
15 | 2a946b45e183 |
hex | 154db01ad3a7 |
23423411213223 has 8 divisors (see below), whose sum is σ = 35692817086848. Its totient is φ = 13384806407544.
The previous prime is 23423411213221. The next prime is 23423411213263. The reversal of 23423411213223 is 32231211432432.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 23423411213223 - 21 = 23423411213221 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23423411213221) 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, 557700266961 + ... + 557700267002.
It is an arithmetic number, because the mean of its divisors is an integer number (4461602135856).
Almost surely, 223423411213223 is an apocalyptic number.
23423411213223 is a deficient number, since it is larger than the sum of its proper divisors (12269405873625).
23423411213223 is a wasteful number, since it uses less digits than its factorization.
23423411213223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1115400533973.
The product of its digits is 41472, while the sum is 33.
Adding to 23423411213223 its reverse (32231211432432), we get a palindrome (55654622645655).
The spelling of 23423411213223 in words is "twenty-three trillion, four hundred twenty-three billion, four hundred eleven million, two hundred thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •