Base | Representation |
---|---|
bin | 1001000111100000… |
… | …01010110101100000 |
3 | 110122010102110101102 |
4 | 10203300022311200 |
5 | 40011032002102 |
6 | 2125412253532 |
7 | 232204042430 |
oct | 44360126540 |
9 | 13563373342 |
10 | 4894797152 |
11 | 2091a92603 |
12 | b473112a8 |
13 | 600115b9b |
14 | 3461182c0 |
15 | 1d9ac5402 |
hex | 123c0ad60 |
4894797152 has 48 divisors (see below), whose sum is σ = 11092596480. Its totient is φ = 2082665088.
The previous prime is 4894797151. The next prime is 4894797179. The reversal of 4894797152 is 2517974984.
It is a happy number.
It is a super-2 number, since 2×48947971522 = 47918078318454622208, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (56).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4894797151) 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 7 ways as a sum of consecutive naturals, for example, 47468 + ... + 109739.
It is an arithmetic number, because the mean of its divisors is an integer number (231095760).
Almost surely, 24894797152 is an apocalyptic number.
It is an amenable number.
4894797152 is an abundant number, since it is smaller than the sum of its proper divisors (6197799328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4894797152 is a wasteful number, since it uses less digits than its factorization.
4894797152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157363 (or 157355 counting only the distinct ones).
The product of its digits is 5080320, while the sum is 56.
The square root of 4894797152 is about 69962.8269297346. The cubic root of 4894797152 is about 1697.8978806077.
The spelling of 4894797152 in words is "four billion, eight hundred ninety-four million, seven hundred ninety-seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •