Base | Representation |
---|---|
bin | 101110001101000… |
… | …0011010100001100 |
3 | 11000001020002100000 |
4 | 1130122003110030 |
5 | 11133341130241 |
6 | 413501004300 |
7 | 53263420566 |
oct | 13432032414 |
9 | 4001202300 |
10 | 1550333196 |
11 | 726139305 |
12 | 373253690 |
13 | 1b9266229 |
14 | 109c86336 |
15 | 9118ceb6 |
hex | 5c68350c |
1550333196 has 144 divisors (see below), whose sum is σ = 4318146560. Its totient is φ = 484989120.
The previous prime is 1550333171. The next prime is 1550333227. The reversal of 1550333196 is 6913330551.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 1550333196.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 2345106 + ... + 2345766.
Almost surely, 21550333196 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 1550333196, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2159073280).
1550333196 is an abundant number, since it is smaller than the sum of its proper divisors (2767813364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1550333196 is a wasteful number, since it uses less digits than its factorization.
1550333196 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 826 (or 812 counting only the distinct ones).
The product of its (nonzero) digits is 36450, while the sum is 36.
The square root of 1550333196 is about 39374.2707361038. The cubic root of 1550333196 is about 1157.3774473232.
The spelling of 1550333196 in words is "one billion, five hundred fifty million, three hundred thirty-three thousand, one hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •