Base | Representation |
---|---|
bin | 101000010000100… |
… | …0101110101000100 |
3 | 10111010212101110011 |
4 | 1100201011311010 |
5 | 10231304230113 |
6 | 342013240004 |
7 | 45322023520 |
oct | 12041056504 |
9 | 3433771404 |
10 | 1350851908 |
11 | 63358003a |
12 | 318493004 |
13 | 186b31073 |
14 | cb59ad80 |
15 | 7d8d763d |
hex | 50845d44 |
1350851908 has 48 divisors (see below), whose sum is σ = 2796530688. Its totient is φ = 558720000.
The previous prime is 1350851899. The next prime is 1350851927. The reversal of 1350851908 is 8091580531.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors.
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 15 ways as a sum of consecutive naturals, for example, 346128 + ... + 350008.
It is an arithmetic number, because the mean of its divisors is an integer number (58261056).
Almost surely, 21350851908 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 1350851908, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1398265344).
1350851908 is an abundant number, since it is smaller than the sum of its proper divisors (1445678780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1350851908 is a wasteful number, since it uses less digits than its factorization.
1350851908 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4324 (or 4322 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 40.
The square root of 1350851908 is about 36753.9373128921. The cubic root of 1350851908 is about 1105.4418789233.
The spelling of 1350851908 in words is "one billion, three hundred fifty million, eight hundred fifty-one thousand, nine hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •