Base | Representation |
---|---|
bin | 101001110010101… |
… | …0110101011001011 |
3 | 10121201200021111221 |
4 | 1103211112223023 |
5 | 10332442114011 |
6 | 351052102511 |
7 | 46515235330 |
oct | 12345265313 |
9 | 3551607457 |
10 | 1402301131 |
11 | 65a620660 |
12 | 331764a37 |
13 | 1946a5caa |
14 | d4350987 |
15 | 8319b971 |
hex | 53956acb |
1402301131 has 16 divisors (see below), whose sum is σ = 1749242880. Its totient is φ = 1092127680.
The previous prime is 1402301129. The next prime is 1402301149. The reversal of 1402301131 is 1311032041.
It is not a de Polignac number, because 1402301131 - 21 = 1402301129 is a prime.
It is a super-2 number, since 2×14023011312 = 3932896924007758322, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1402301101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 198030 + ... + 204988.
It is an arithmetic number, because the mean of its divisors is an integer number (109327680).
Almost surely, 21402301131 is an apocalyptic number.
1402301131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1402301131 is a deficient number, since it is larger than the sum of its proper divisors (346941749).
1402301131 is a wasteful number, since it uses less digits than its factorization.
1402301131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9594.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 1402301131 is about 37447.3113988174. The cubic root of 1402301131 is about 1119.3015231978.
Adding to 1402301131 its reverse (1311032041), we get a palindrome (2713333172).
The spelling of 1402301131 in words is "one billion, four hundred two million, three hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •