Base | Representation |
---|---|
bin | 111010101011001000011… |
… | …000100010101111110111 |
3 | 112021110101212212100011122 |
4 | 322223020120202233313 |
5 | 1012030110021410011 |
6 | 12324143312054155 |
7 | 564206511502163 |
oct | 72531030425767 |
9 | 15243355770148 |
10 | 4032041200631 |
11 | 1314a85162974 |
12 | 55152a53435b |
13 | 2332b2032052 |
14 | dd21a8c9ca3 |
15 | 6ed38dd43db |
hex | 3aac8622bf7 |
4032041200631 has 2 divisors, whose sum is σ = 4032041200632. Its totient is φ = 4032041200630.
The previous prime is 4032041200591. The next prime is 4032041200639. The reversal of 4032041200631 is 1360021402304.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 4032041200631 - 234 = 4014861331447 is a prime.
It is a super-2 number, since 2×40320412006312 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4032041200631.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4032041200639) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2016020600315 + 2016020600316.
It is an arithmetic number, because the mean of its divisors is an integer number (2016020600316).
Almost surely, 24032041200631 is an apocalyptic number.
4032041200631 is a deficient number, since it is larger than the sum of its proper divisors (1).
4032041200631 is an equidigital number, since it uses as much as digits as its factorization.
4032041200631 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 4032041200631 its reverse (1360021402304), we get a palindrome (5392062602935).
The spelling of 4032041200631 in words is "four trillion, thirty-two billion, forty-one million, two hundred thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •