Base | Representation |
---|---|
bin | 101000010000110… |
… | …0110101000001010 |
3 | 10111011010012201210 |
4 | 1100201212220022 |
5 | 10231323030000 |
6 | 342020153550 |
7 | 45323123265 |
oct | 12041465012 |
9 | 3434105653 |
10 | 1350986250 |
11 | 633661a69 |
12 | 3185388b6 |
13 | 186b7a263 |
14 | cb5d3cdc |
15 | 7d912350 |
hex | 50866a0a |
1350986250 has 80 divisors (see below), whose sum is σ = 3390114816. Its totient is φ = 358800000.
The previous prime is 1350986227. The next prime is 1350986261. The reversal of 1350986250 is 526890531.
It is a junction number, because it is equal to n+sod(n) for n = 1350986199 and 1350986208.
It is a congruent number.
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 39 ways as a sum of consecutive naturals, for example, 1173175 + ... + 1174325.
Almost surely, 21350986250 is an apocalyptic number.
1350986250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1350986250, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1695057408).
1350986250 is an abundant number, since it is smaller than the sum of its proper divisors (2039128566).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1350986250 is a wasteful number, since it uses less digits than its factorization.
1350986250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1489 (or 1474 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 39.
The square root of 1350986250 is about 36755.7648539654. The cubic root of 1350986250 is about 1105.4785230462.
The spelling of 1350986250 in words is "one billion, three hundred fifty million, nine hundred eighty-six thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •