Base | Representation |
---|---|
bin | 1010110000101001110110… |
… | …01000011001010010011101 |
3 | 10002210001200011020000101022 |
4 | 11120110323020121102131 |
5 | 11100134202010441031 |
6 | 122154054005253525 |
7 | 4661343412013216 |
oct | 530247310312235 |
9 | 102701604200338 |
10 | 23661966890141 |
11 | 75a2a90497008 |
12 | 27a1a20a042a5 |
13 | 1028410852028 |
14 | 5bb3611a840d |
15 | 2b077e6bc97b |
hex | 15853b21949d |
23661966890141 has 4 divisors (see below), whose sum is σ = 23661980316000. Its totient is φ = 23661953464284.
The previous prime is 23661966890131. The next prime is 23661966890167. The reversal of 23661966890141 is 14109866916632.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 23661966890141 - 242 = 19263920379037 is a prime.
It is a super-2 number, since 2×236619668901412 (a number of 28 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 (23661966890131) 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, 3582791 + ... + 7756308.
It is an arithmetic number, because the mean of its divisors is an integer number (5915495079000).
Almost surely, 223661966890141 is an apocalyptic number.
It is an amenable number.
23661966890141 is a deficient number, since it is larger than the sum of its proper divisors (13425859).
23661966890141 is a wasteful number, since it uses less digits than its factorization.
23661966890141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13425858.
The product of its (nonzero) digits is 20155392, while the sum is 62.
The spelling of 23661966890141 in words is "twenty-three trillion, six hundred sixty-one billion, nine hundred sixty-six million, eight hundred ninety thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •