Base | Representation |
---|---|
bin | 1111110000111111… |
… | …0011011001101011 |
3 | 101220221020221011122 |
4 | 3330033303121223 |
5 | 32131343014011 |
6 | 1535534245455 |
7 | 206605262501 |
oct | 37417633153 |
9 | 11827227148 |
10 | 4232001131 |
11 | 18819440a6 |
12 | 9a135688b |
13 | 525a017a7 |
14 | 2c20a6671 |
15 | 19b8013db |
hex | fc3f366b |
4232001131 has 8 divisors (see below), whose sum is σ = 4504163184. Its totient is φ = 3962419200.
The previous prime is 4232001121. The next prime is 4232001143. The reversal of 4232001131 is 1311002324.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4232001131 is a prime.
It is a super-2 number, since 2×42320011312 = 35819667145570558322, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4232001121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 641645 + ... + 648206.
It is an arithmetic number, because the mean of its divisors is an integer number (563020398).
Almost surely, 24232001131 is an apocalyptic number.
4232001131 is a deficient number, since it is larger than the sum of its proper divisors (272162053).
4232001131 is a wasteful number, since it uses less digits than its factorization.
4232001131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1290061.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 4232001131 is about 65053.8325619636. The cubic root of 4232001131 is about 1617.5160239115.
Adding to 4232001131 its reverse (1311002324), we get a palindrome (5543003455).
The spelling of 4232001131 in words is "four billion, two hundred thirty-two million, one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •