Base | Representation |
---|---|
bin | 110111100010010… |
… | …0110001110101110 |
3 | 11210212110101200220 |
4 | 1233010212032232 |
5 | 12304022214032 |
6 | 504524432210 |
7 | 64115200023 |
oct | 15704461656 |
9 | 4725411626 |
10 | 1863476142 |
11 | 87697a230 |
12 | 4400a8666 |
13 | 2390b6308 |
14 | 1396bb54a |
15 | ad8e612c |
hex | 6f1263ae |
1863476142 has 64 divisors (see below), whose sum is σ = 4225478400. Its totient is φ = 542689280.
The previous prime is 1863476137. The next prime is 1863476221. The reversal of 1863476142 is 2416743681.
It is a junction number, because it is equal to n+sod(n) for n = 1863476094 and 1863476103.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 432334 + ... + 436622.
It is an arithmetic number, because the mean of its divisors is an integer number (66023100).
Almost surely, 21863476142 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1863476142, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2112739200).
1863476142 is an abundant number, since it is smaller than the sum of its proper divisors (2362002258).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1863476142 is a wasteful number, since it uses less digits than its factorization.
1863476142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4561.
The product of its digits is 193536, while the sum is 42.
The square root of 1863476142 is about 43167.9990502224. Note that the first 3 decimals coincide. The cubic root of 1863476142 is about 1230.5745970241.
The spelling of 1863476142 in words is "one billion, eight hundred sixty-three million, four hundred seventy-six thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •