Base | Representation |
---|---|
bin | 101010100111111… |
… | …0100010111011101 |
3 | 10200200012012022020 |
4 | 1111033310113131 |
5 | 10412113210023 |
6 | 353530210353 |
7 | 50304404331 |
oct | 12517642735 |
9 | 3620165266 |
10 | 1430210013 |
11 | 674352a51 |
12 | 33ab839b9 |
13 | 19a3c821b |
14 | d7d377c1 |
15 | 85860de3 |
hex | 553f45dd |
1430210013 has 8 divisors (see below), whose sum is σ = 1933805376. Its totient is φ = 940044000.
The previous prime is 1430209987. The next prime is 1430210021. The reversal of 1430210013 is 3100120341.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1430210013 - 28 = 1430209757 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1430209974 and 1430210001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1430210063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3357088 + ... + 3357513.
It is an arithmetic number, because the mean of its divisors is an integer number (241725672).
Almost surely, 21430210013 is an apocalyptic number.
It is an amenable number.
1430210013 is a deficient number, since it is larger than the sum of its proper divisors (503595363).
1430210013 is an equidigital number, since it uses as much as digits as its factorization.
1430210013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6714675.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 1430210013 is about 37818.1175232189. The cubic root of 1430210013 is about 1126.6783214349.
Adding to 1430210013 its reverse (3100120341), we get a palindrome (4530330354).
The spelling of 1430210013 in words is "one billion, four hundred thirty million, two hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •