Base | Representation |
---|---|
bin | 1100100011100011000… |
… | …00101001001000101111 |
3 | 1112020112002022010212002 |
4 | 12101301200221020233 |
5 | 24032002141041421 |
6 | 530103303002515 |
7 | 43111343643554 |
oct | 6216140511057 |
9 | 1466462263762 |
10 | 431401112111 |
11 | 156a57754722 |
12 | 6b73743943b |
13 | 318b1081158 |
14 | 16c4672ca2b |
15 | b34d536b0b |
hex | 647182922f |
431401112111 has 8 divisors (see below), whose sum is σ = 432214202784. Its totient is φ = 430588339200.
The previous prime is 431401112083. The next prime is 431401112173. The reversal of 431401112111 is 111211104134.
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 431401112111 - 230 = 430327370287 is a prime.
It is a super-2 number, since 2×4314011121112 (a number of 24 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 (431401112011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2731670 + ... + 2885276.
It is an arithmetic number, because the mean of its divisors is an integer number (54026775348).
Almost surely, 2431401112111 is an apocalyptic number.
431401112111 is a deficient number, since it is larger than the sum of its proper divisors (813090673).
431401112111 is a wasteful number, since it uses less digits than its factorization.
431401112111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158881.
The product of its (nonzero) digits is 96, while the sum is 20.
Adding to 431401112111 its reverse (111211104134), we get a palindrome (542612216245).
The spelling of 431401112111 in words is "four hundred thirty-one billion, four hundred one million, one hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •