Base | Representation |
---|---|
bin | 1100100100111001001… |
… | …11011011001000011001 |
3 | 1112022101111010101220121 |
4 | 12102130213123020121 |
5 | 24034442310410131 |
6 | 530303135353241 |
7 | 43135305013414 |
oct | 6223447331031 |
9 | 1468344111817 |
10 | 432124310041 |
11 | 1572989a8a66 |
12 | 6b8b9682821 |
13 | 31997b53418 |
14 | 16cb47c4b7b |
15 | b391c8c911 |
hex | 649c9db219 |
432124310041 has 8 divisors (see below), whose sum is σ = 454955122400. Its totient is φ = 409302240480.
The previous prime is 432124310039. The next prime is 432124310077. The reversal of 432124310041 is 140013421234.
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 432124310041 - 21 = 432124310039 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 432124309988 and 432124310015.
It is not an unprimeable number, because it can be changed into a prime (432124310441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2084115 + ... + 2282056.
It is an arithmetic number, because the mean of its divisors is an integer number (56869390300).
Almost surely, 2432124310041 is an apocalyptic number.
It is an amenable number.
432124310041 is a deficient number, since it is larger than the sum of its proper divisors (22830812359).
432124310041 is a wasteful number, since it uses less digits than its factorization.
432124310041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4371399.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 432124310041 its reverse (140013421234), we get a palindrome (572137731275).
The spelling of 432124310041 in words is "four hundred thirty-two billion, one hundred twenty-four million, three hundred ten thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •