Base | Representation |
---|---|
bin | 110000001010010100101101… |
… | …1101100011111001010100111 |
3 | 2001112221202112122121011112202 |
4 | 1200110221123230133022213 |
5 | 421011233442210143221 |
6 | 4100553315133005115 |
7 | 155142232406212520 |
oct | 14024513354371247 |
9 | 2045852478534482 |
10 | 423631342662311 |
11 | 112a89052983003 |
12 | 3b61a71362379b |
13 | 1524c3585a84c4 |
14 | 7687c1b515847 |
15 | 33e9953ebad0b |
hex | 1814a5bb1f2a7 |
423631342662311 has 4 divisors (see below), whose sum is σ = 484150105899792. Its totient is φ = 363112579424832.
The previous prime is 423631342662293. The next prime is 423631342662397. The reversal of 423631342662311 is 113266243136324.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-423631342662311 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 (423631342662511) 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, 30259381618730 + ... + 30259381618743.
It is an arithmetic number, because the mean of its divisors is an integer number (121037526474948).
Almost surely, 2423631342662311 is an apocalyptic number.
423631342662311 is a deficient number, since it is larger than the sum of its proper divisors (60518763237481).
423631342662311 is an equidigital number, since it uses as much as digits as its factorization.
423631342662311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60518763237480.
The product of its digits is 2239488, while the sum is 47.
Adding to 423631342662311 its reverse (113266243136324), we get a palindrome (536897585798635).
The spelling of 423631342662311 in words is "four hundred twenty-three trillion, six hundred thirty-one billion, three hundred forty-two million, six hundred sixty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •