Base | Representation |
---|---|
bin | 1111001010100010… |
… | …00000001000001100 |
3 | 210000101111022110200 |
4 | 13211101000020030 |
5 | 113133200003412 |
6 | 3423510333500 |
7 | 405515546454 |
oct | 74521001014 |
9 | 23011438420 |
10 | 8141406732 |
11 | 34a8680418 |
12 | 16b265a290 |
13 | 9c9923844 |
14 | 573396d64 |
15 | 329b2d9dc |
hex | 1e544020c |
8141406732 has 18 divisors (see below), whose sum is σ = 20579667108. Its totient is φ = 2713802232.
The previous prime is 8141406731. The next prime is 8141406739. The reversal of 8141406732 is 2376041418.
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (36), and also a Moran number because the ratio is a prime number: 226150187 = 8141406732 / (8 + 1 + 4 + 1 + 4 + 0 + 6 + 7 + 3 + 2).
It is not an unprimeable number, because it can be changed into a prime (8141406731) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 113075058 + ... + 113075129.
Almost surely, 28141406732 is an apocalyptic number.
It is an amenable number.
8141406732 is an abundant number, since it is smaller than the sum of its proper divisors (12438260376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
8141406732 is a wasteful number, since it uses less digits than its factorization.
8141406732 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226150197 (or 226150192 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 36.
The square root of 8141406732 is about 90229.7441645492. The cubic root of 8141406732 is about 2011.7151381163.
The spelling of 8141406732 in words is "eight billion, one hundred forty-one million, four hundred six thousand, seven hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •