Base | Representation |
---|---|
bin | 1010011110101011000011… |
… | …10110110011110101101101 |
3 | 10000120222221211101012201121 |
4 | 11033111201312303311231 |
5 | 11010023400133113401 |
6 | 121002155442540541 |
7 | 4565612206112644 |
oct | 517254166636555 |
9 | 100528854335647 |
10 | 23044141301101 |
11 | 7384a69006648 |
12 | 2702138367751 |
13 | cb208cb5c1cb |
14 | 5994b173835b |
15 | 29e66e948ca1 |
hex | 14f561db3d6d |
23044141301101 has 4 divisors (see below), whose sum is σ = 23047726828192. Its totient is φ = 23040555774012.
The previous prime is 23044141301099. The next prime is 23044141301123. The reversal of 23044141301101 is 10110314144032.
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 23044141301101 - 21 = 23044141301099 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23044141301501) 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, 1792753905 + ... + 1792766758.
It is an arithmetic number, because the mean of its divisors is an integer number (5761931707048).
Almost surely, 223044141301101 is an apocalyptic number.
It is an amenable number.
23044141301101 is a deficient number, since it is larger than the sum of its proper divisors (3585527091).
23044141301101 is an equidigital number, since it uses as much as digits as its factorization.
23044141301101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3585527090.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 23044141301101 its reverse (10110314144032), we get a palindrome (33154455445133).
The spelling of 23044141301101 in words is "twenty-three trillion, forty-four billion, one hundred forty-one million, three hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •