Base | Representation |
---|---|
bin | 1010100111011010100100… |
… | …00001101011010101100001 |
3 | 10001122201021222100011002012 |
4 | 11103231102001223111201 |
5 | 11024434040444100441 |
6 | 121352154230202305 |
7 | 4626405024045443 |
oct | 523552201532541 |
9 | 101581258304065 |
10 | 23344523425121 |
11 | 74903a1979318 |
12 | 27503a97b3395 |
13 | 10044c0bb09b2 |
14 | 5a9c4950a493 |
15 | 2a73a09399eb |
hex | 153b5206b561 |
23344523425121 has 4 divisors (see below), whose sum is σ = 23692949147952. Its totient is φ = 22996097702292.
The previous prime is 23344523425087. The next prime is 23344523425133. The reversal of 23344523425121 is 12152432544332.
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 23344523425121 - 238 = 23069645518177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23344523425021) 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, 174212861315 + ... + 174212861448.
It is an arithmetic number, because the mean of its divisors is an integer number (5923237286988).
Almost surely, 223344523425121 is an apocalyptic number.
It is an amenable number.
23344523425121 is a deficient number, since it is larger than the sum of its proper divisors (348425722831).
23344523425121 is an equidigital number, since it uses as much as digits as its factorization.
23344523425121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 348425722830.
The product of its digits is 691200, while the sum is 41.
Adding to 23344523425121 its reverse (12152432544332), we get a palindrome (35496955969453).
The spelling of 23344523425121 in words is "twenty-three trillion, three hundred forty-four billion, five hundred twenty-three million, four hundred twenty-five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •