Base | Representation |
---|---|
bin | 1000000000101111… |
… | …00011100001110100 |
3 | 102002202100122210110 |
4 | 10000113203201310 |
5 | 32302043022012 |
6 | 1550444223020 |
7 | 211405050660 |
oct | 40027434164 |
9 | 12082318713 |
10 | 4301142132 |
11 | 1907978821 |
12 | a0053aa70 |
13 | 53712c321 |
14 | 2cb3438a0 |
15 | 1a290c73c |
hex | 1005e3874 |
4301142132 has 24 divisors (see below), whose sum is σ = 11469712576. Its totient is φ = 1228897728.
The previous prime is 4301142107. The next prime is 4301142149. The reversal of 4301142132 is 2312411034.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 4301142099 and 4301142108.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25601953 + ... + 25602120.
Almost surely, 24301142132 is an apocalyptic number.
4301142132 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
4301142132 is an abundant number, since it is smaller than the sum of its proper divisors (7168570444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4301142132 is a wasteful number, since it uses less digits than its factorization.
4301142132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51204087 (or 51204085 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
The square root of 4301142132 is about 65583.0933396710. The cubic root of 4301142132 is about 1626.2772924933.
Adding to 4301142132 its reverse (2312411034), we get a palindrome (6613553166).
The spelling of 4301142132 in words is "four billion, three hundred one million, one hundred forty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •