Base | Representation |
---|---|
bin | 101010100111101… |
… | …1010000110001011 |
3 | 10200122222201200222 |
4 | 1111033122012023 |
5 | 10412101234121 |
6 | 353524020255 |
7 | 50303445533 |
oct | 12517320613 |
9 | 3618881628 |
10 | 1430102411 |
11 | 67428a121 |
12 | 33ab3168b |
13 | 19a38b25a |
14 | d7d0a4c3 |
15 | 8583e0ab |
hex | 553da18b |
1430102411 has 4 divisors (see below), whose sum is σ = 1430705424. Its totient is φ = 1429499400.
The previous prime is 1430102383. The next prime is 1430102413. The reversal of 1430102411 is 1142010341.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1142010341 = 61 ⋅18721481.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1430102411 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1430102411.
It is not an unprimeable number, because it can be changed into a prime (1430102413) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 297935 + ... + 302696.
It is an arithmetic number, because the mean of its divisors is an integer number (357676356).
Almost surely, 21430102411 is an apocalyptic number.
1430102411 is a deficient number, since it is larger than the sum of its proper divisors (603013).
1430102411 is an equidigital number, since it uses as much as digits as its factorization.
1430102411 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 603012.
The product of its (nonzero) digits is 96, while the sum is 17.
The square root of 1430102411 is about 37816.6948714453. The cubic root of 1430102411 is about 1126.6500654724.
Adding to 1430102411 its reverse (1142010341), we get a palindrome (2572112752).
The spelling of 1430102411 in words is "one billion, four hundred thirty million, one hundred two thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •