Base | Representation |
---|---|
bin | 1001000111001011… |
… | …00010111001110001 |
3 | 110121221011222002000 |
4 | 10203211202321301 |
5 | 40004323342040 |
6 | 2125232444213 |
7 | 232141263036 |
oct | 44345427161 |
9 | 13557158060 |
10 | 4892012145 |
11 | 2090460149 |
12 | b463a9669 |
13 | 5cc67c357 |
14 | 3459d138d |
15 | 1d9725130 |
hex | 123962e71 |
4892012145 has 32 divisors (see below), whose sum is σ = 8816064000. Its totient is φ = 2573327232.
The previous prime is 4892012131. The next prime is 4892012149. The reversal of 4892012145 is 5412102984.
4892012145 is a `hidden beast` number, since 489 + 20 + 12 + 145 = 666.
4892012145 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 4892012145 - 25 = 4892012113 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (4892012149) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 238345 + ... + 258054.
It is an arithmetic number, because the mean of its divisors is an integer number (275502000).
Almost surely, 24892012145 is an apocalyptic number.
4892012145 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
4892012145 is a deficient number, since it is larger than the sum of its proper divisors (3924051855).
4892012145 is a wasteful number, since it uses less digits than its factorization.
4892012145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 496486 (or 496480 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 36.
The square root of 4892012145 is about 69942.9206210321. The cubic root of 4892012145 is about 1697.5758002133.
The spelling of 4892012145 in words is "four billion, eight hundred ninety-two million, twelve thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •