Base | Representation |
---|---|
bin | 101010101001011… |
… | …0101010001000010 |
3 | 10200201200100010211 |
4 | 1111102311101002 |
5 | 10412314001010 |
6 | 353555144334 |
7 | 50314205020 |
oct | 12522652102 |
9 | 3621610124 |
10 | 1431000130 |
11 | 67484263a |
12 | 33b2a50aa |
13 | 19a613a51 |
14 | d80a1710 |
15 | 8596a08a |
hex | 554b5442 |
1431000130 has 32 divisors (see below), whose sum is σ = 2945074176. Its totient is φ = 490411584.
The previous prime is 1431000091. The next prime is 1431000133. The reversal of 1431000130 is 310001341.
It is a super-2 number, since 2×14310001302 = 4095522744120033800, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1431000130.
It is not an unprimeable number, because it can be changed into a prime (1431000133) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 308992 + ... + 313588.
It is an arithmetic number, because the mean of its divisors is an integer number (92033568).
Almost surely, 21431000130 is an apocalyptic number.
1431000130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1431000130 is an abundant number, since it is smaller than the sum of its proper divisors (1514074046).
1431000130 is a wasteful number, since it uses less digits than its factorization.
1431000130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9058.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 1431000130 is about 37828.5623570339. The cubic root of 1431000130 is about 1126.8857603905.
Adding to 1431000130 its reverse (310001341), we get a palindrome (1741001471).
The spelling of 1431000130 in words is "one billion, four hundred thirty-one million, one hundred thirty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •