Base | Representation |
---|---|
bin | 1010101001101001000110… |
… | …11100111111001010101011 |
3 | 10001221000211100100110002211 |
4 | 11110310203130333022223 |
5 | 11032212303133411121 |
6 | 121451252115505551 |
7 | 4635054326500444 |
oct | 524644334771253 |
9 | 101830740313084 |
10 | 23421051466411 |
11 | 750a8a2a70435 |
12 | 27631a68b82b7 |
13 | 100b798916771 |
14 | 5ad8291062cb |
15 | 2a937e1d9ce1 |
hex | 154d2373f2ab |
23421051466411 has 4 divisors (see below), whose sum is σ = 24228673930800. Its totient is φ = 22613429002024.
The previous prime is 23421051466289. The next prime is 23421051466433. The reversal of 23421051466411 is 11466415012432.
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 23421051466411 - 243 = 14624958444203 is a prime.
It is a super-2 number, since 2×234210514664112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23421051469411) 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, 403811232151 + ... + 403811232208.
It is an arithmetic number, because the mean of its divisors is an integer number (6057168482700).
Almost surely, 223421051466411 is an apocalyptic number.
23421051466411 is a deficient number, since it is larger than the sum of its proper divisors (807622464389).
23421051466411 is an equidigital number, since it uses as much as digits as its factorization.
23421051466411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 807622464388.
The product of its (nonzero) digits is 138240, while the sum is 40.
Adding to 23421051466411 its reverse (11466415012432), we get a palindrome (34887466478843).
The spelling of 23421051466411 in words is "twenty-three trillion, four hundred twenty-one billion, fifty-one million, four hundred sixty-six thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •