Base | Representation |
---|---|
bin | 111000100100001… |
… | …100111010000000 |
3 | 2110010201220200000 |
4 | 320210030322000 |
5 | 3420421423034 |
6 | 234100400000 |
7 | 32342326041 |
oct | 7044147200 |
9 | 2403656600 |
10 | 949014144 |
11 | 44776a411 |
12 | 2259a6000 |
13 | 1217c8140 |
14 | 900788c8 |
15 | 584ae599 |
hex | 3890ce80 |
949014144 has 192 divisors, whose sum is σ = 3051179040. Its totient is φ = 291879936.
The previous prime is 949014127. The next prime is 949014151. The reversal of 949014144 is 441410949.
It is a tau number, because it is divible by the number of its divisors (192).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 949014099 and 949014108.
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 23 ways as a sum of consecutive naturals, for example, 403179 + ... + 405525.
Almost surely, 2949014144 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 949014144, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1525589520).
949014144 is an abundant number, since it is smaller than the sum of its proper divisors (2102164896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
949014144 is a wasteful number, since it uses less digits than its factorization.
949014144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2389 (or 2365 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 36.
The square root of 949014144 is about 30806.0731674779. The cubic root of 949014144 is about 982.7074044980.
The spelling of 949014144 in words is "nine hundred forty-nine million, fourteen thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •