Base | Representation |
---|---|
bin | 110010101000011… |
… | …011000000000000 |
3 | 2012012101220011000 |
4 | 302220123000000 |
5 | 3214430112102 |
6 | 220142452000 |
7 | 30023160315 |
oct | 6250330000 |
9 | 2165356130 |
10 | 849457152 |
11 | 3a6550805 |
12 | 1b8594000 |
13 | 106cab18b |
14 | 80b60d0c |
15 | 4e89601c |
hex | 32a1b000 |
849457152 has 104 divisors (see below), whose sum is σ = 2516930480. Its totient is φ = 283115520.
The previous prime is 849457151. The next prime is 849457157. The reversal of 849457152 is 251754948.
849457152 is a `hidden beast` number, since 8 + 49 + 457 + 152 = 666.
It is a super-2 number, since 2×8494571522 = 1443154906167902208, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 849457098 and 849457107.
It is not an unprimeable number, because it can be changed into a prime (849457151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 106752 + ... + 114432.
Almost surely, 2849457152 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 849457152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1258465240).
849457152 is an abundant number, since it is smaller than the sum of its proper divisors (1667473328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
849457152 is an equidigital number, since it uses as much as digits as its factorization.
849457152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7714 (or 7686 counting only the distinct ones).
The product of its digits is 403200, while the sum is 45.
The square root of 849457152 is about 29145.4482209487. The cubic root of 849457152 is about 947.0665382936.
The spelling of 849457152 in words is "eight hundred forty-nine million, four hundred fifty-seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •