Base | Representation |
---|---|
bin | 10001000001110100… |
… | …01100101100000000 |
3 | 212121010101212012101 |
4 | 20200322030230000 |
5 | 122210331434244 |
6 | 4111054040144 |
7 | 442356146320 |
oct | 104072145400 |
9 | 25533355171 |
10 | 9142061824 |
11 | 39715013a5 |
12 | 19317a9054 |
13 | b2902cc4c |
14 | 62a235280 |
15 | 3878de0d4 |
hex | 220e8cb00 |
9142061824 has 144 divisors (see below), whose sum is σ = 21569825088. Its totient is φ = 3785342976.
The previous prime is 9142061813. The next prime is 9142061833. The reversal of 9142061824 is 4281602419.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 11470194 + ... + 11470990.
It is an arithmetic number, because the mean of its divisors is an integer number (149790452).
Almost surely, 29142061824 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 9142061824, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10784912544).
9142061824 is an abundant number, since it is smaller than the sum of its proper divisors (12427763264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
9142061824 is a wasteful number, since it uses less digits than its factorization.
9142061824 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1030 (or 1016 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 37.
The square root of 9142061824 is about 95614.1298344549. The cubic root of 9142061824 is about 2090.9712009816.
The spelling of 9142061824 in words is "nine billion, one hundred forty-two million, sixty-one thousand, eight hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •