Base | Representation |
---|---|
bin | 110111011111000… |
… | …1101010001010101 |
3 | 11210202022021220021 |
4 | 1232332031101111 |
5 | 12303110113140 |
6 | 504424505141 |
7 | 64065022246 |
oct | 15676152125 |
9 | 4722267807 |
10 | 1861801045 |
11 | 875a35755 |
12 | 43b61b1b1 |
13 | 23894aa30 |
14 | 1393a2ccd |
15 | ad6b4b4a |
hex | 6ef8d455 |
1861801045 has 8 divisors (see below), whose sum is σ = 2406019896. Its totient is φ = 1374868416.
The previous prime is 1861801043. The next prime is 1861801061. The reversal of 1861801045 is 5401081681.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 261080964 + 1600720081 = 16158^2 + 40009^2 .
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 1861801045 - 21 = 1861801043 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 1861801045.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1861801043) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14321482 + ... + 14321611.
It is an arithmetic number, because the mean of its divisors is an integer number (300752487).
Almost surely, 21861801045 is an apocalyptic number.
It is an amenable number.
1861801045 is a deficient number, since it is larger than the sum of its proper divisors (544218851).
1861801045 is a wasteful number, since it uses less digits than its factorization.
1861801045 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28643111.
The product of its (nonzero) digits is 7680, while the sum is 34.
The square root of 1861801045 is about 43148.5926189951. The cubic root of 1861801045 is about 1230.2057612896.
The spelling of 1861801045 in words is "one billion, eight hundred sixty-one million, eight hundred one thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •