Base | Representation |
---|---|
bin | 1010101001001011111101… |
… | …00111100111110111111111 |
3 | 10001212112102122110001222012 |
4 | 11110211332213213313333 |
5 | 11031433230141041223 |
6 | 121440143130241435 |
7 | 4633661441620265 |
oct | 524457647476777 |
9 | 101775378401865 |
10 | 23405401112063 |
11 | 75041a1828593 |
12 | 276015958627b |
13 | 100a173421369 |
14 | 5acb8278c435 |
15 | 2a8c6525cc78 |
hex | 15497e9e7dff |
23405401112063 has 8 divisors (see below), whose sum is σ = 23668784982000. Its totient is φ = 23142026171968.
The previous prime is 23405401112059. The next prime is 23405401112081. The reversal of 23405401112063 is 36021110450432.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 23405401112063 - 22 = 23405401112059 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 (23405407112063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3110645 + ... + 7515777.
It is an arithmetic number, because the mean of its divisors is an integer number (2958598122750).
Almost surely, 223405401112063 is an apocalyptic number.
23405401112063 is a deficient number, since it is larger than the sum of its proper divisors (263383869937).
23405401112063 is an equidigital number, since it uses as much as digits as its factorization.
23405401112063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4464921.
The product of its (nonzero) digits is 17280, while the sum is 32.
Adding to 23405401112063 its reverse (36021110450432), we get a palindrome (59426511562495).
The spelling of 23405401112063 in words is "twenty-three trillion, four hundred five billion, four hundred one million, one hundred twelve thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •