Base | Representation |
---|---|
bin | 1011101101001101… |
… | …1100001001010011 |
3 | 22010000001020222201 |
4 | 2323103130021103 |
5 | 22413430413121 |
6 | 1235453144031 |
7 | 140605155163 |
oct | 27323341123 |
9 | 8100036881 |
10 | 3142435411 |
11 | 1372906265 |
12 | 73848b017 |
13 | 3b106524b |
14 | 21b4c25a3 |
15 | 135d2be91 |
hex | bb4dc253 |
3142435411 has 8 divisors (see below), whose sum is σ = 3168751040. Its totient is φ = 3116173032.
The previous prime is 3142435409. The next prime is 3142435423. The reversal of 3142435411 is 1145342413.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3142435411 - 21 = 3142435409 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 3142435411.
It is not an unprimeable number, because it can be changed into a prime (3142435451) 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 7 ways as a sum of consecutive naturals, for example, 109936 + ... + 135538.
It is an arithmetic number, because the mean of its divisors is an integer number (396093880).
Almost surely, 23142435411 is an apocalyptic number.
3142435411 is a deficient number, since it is larger than the sum of its proper divisors (26315629).
3142435411 is a wasteful number, since it uses less digits than its factorization.
3142435411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26625.
The product of its digits is 5760, while the sum is 28.
The square root of 3142435411 is about 56057.4295789595. The cubic root of 3142435411 is about 1464.7228386903.
Adding to 3142435411 its reverse (1145342413), we get a palindrome (4287777824).
The spelling of 3142435411 in words is "three billion, one hundred forty-two million, four hundred thirty-five thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •