Base | Representation |
---|---|
bin | 101000001111000… |
… | …0000000000110010 |
3 | 10111002100012222121 |
4 | 1100132000000302 |
5 | 10231102313100 |
6 | 341544024454 |
7 | 45312110326 |
oct | 12036000062 |
9 | 3432305877 |
10 | 1350041650 |
11 | 633077301 |
12 | 31816212a |
13 | 186909319 |
14 | cb429986 |
15 | 7d7c751a |
hex | 50780032 |
1350041650 has 12 divisors (see below), whose sum is σ = 2511077562. Its totient is φ = 540016640.
The previous prime is 1350041647. The next prime is 1350041653. The reversal of 1350041650 is 561400531.
It is an interprime number because it is at equal distance from previous prime (1350041647) and next prime (1350041653).
It can be written as a sum of positive squares in 3 ways, for example, as 679801329 + 670240321 = 26073^2 + 25889^2 .
It is a super-2 number, since 2×13500416502 = 3645224913469445000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (1350041653) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 13500367 + ... + 13500466.
Almost surely, 21350041650 is an apocalyptic number.
1350041650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1350041650 is a deficient number, since it is larger than the sum of its proper divisors (1161035912).
1350041650 is a wasteful number, since it uses less digits than its factorization.
1350041650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27000845 (or 27000840 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 25.
The square root of 1350041650 is about 36742.9129220861. The cubic root of 1350041650 is about 1105.2208153946.
The spelling of 1350041650 in words is "one billion, three hundred fifty million, forty-one thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •