Base | Representation |
---|---|
bin | 1100100011000010110… |
… | …11000000111001010000 |
3 | 1112012211021102020120010 |
4 | 12101201123000321100 |
5 | 24030424041413404 |
6 | 530020421514520 |
7 | 43101555513162 |
oct | 6214133007120 |
9 | 1465737366503 |
10 | 431131201104 |
11 | 15692936157a |
12 | 6b680b72a40 |
13 | 3186a1899b6 |
14 | 16c1c94c932 |
15 | b3349bd189 |
hex | 64616c0e50 |
431131201104 has 80 divisors (see below), whose sum is σ = 1129943909120. Its totient is φ = 141628331520.
The previous prime is 431131201091. The next prime is 431131201177. The reversal of 431131201104 is 401102131134.
It is a super-2 number, since 2×4311312011042 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1946394 + ... + 2156550.
It is an arithmetic number, because the mean of its divisors is an integer number (14124298864).
Almost surely, 2431131201104 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 431131201104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (564971954560).
431131201104 is an abundant number, since it is smaller than the sum of its proper divisors (698812708016).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
431131201104 is a wasteful number, since it uses less digits than its factorization.
431131201104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210788 (or 210782 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 431131201104 its reverse (401102131134), we get a palindrome (832233332238).
The spelling of 431131201104 in words is "four hundred thirty-one billion, one hundred thirty-one million, two hundred one thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •