Base | Representation |
---|---|
bin | 100000011000010… |
… | …1001010011110101 |
3 | 2210201102121111100 |
4 | 1000300221103311 |
5 | 4211120301231 |
6 | 255451200313 |
7 | 35632021551 |
oct | 10060512365 |
9 | 2721377440 |
10 | 1086493941 |
11 | 50832aa85 |
12 | 263a46099 |
13 | 144132330 |
14 | a4424861 |
15 | 655b91e6 |
hex | 40c294f5 |
1086493941 has 48 divisors (see below), whose sum is σ = 1775120256. Its totient is φ = 635361408.
The previous prime is 1086493939. The next prime is 1086493999. The reversal of 1086493941 is 1493946801.
It is not a de Polignac number, because 1086493941 - 21 = 1086493939 is a prime.
It is a super-2 number, since 2×10864939412 = 2360938167659422962, which contains 22 as substring.
It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1086493931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 437395 + ... + 439871.
It is an arithmetic number, because the mean of its divisors is an integer number (36981672).
Almost surely, 21086493941 is an apocalyptic number.
It is an amenable number.
1086493941 is a deficient number, since it is larger than the sum of its proper divisors (688626315).
1086493941 is a wasteful number, since it uses less digits than its factorization.
1086493941 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2682 (or 2679 counting only the distinct ones).
The product of its (nonzero) digits is 186624, while the sum is 45.
The square root of 1086493941 is about 32962.0075389834. The cubic root of 1086493941 is about 1028.0378458237.
The spelling of 1086493941 in words is "one billion, eighty-six million, four hundred ninety-three thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •