Base | Representation |
---|---|
bin | 101000001111001… |
… | …0111111110100111 |
3 | 10111002112012122100 |
4 | 1100132113332213 |
5 | 10231113433230 |
6 | 341550103143 |
7 | 45312666453 |
oct | 12036277647 |
9 | 3432465570 |
10 | 1350139815 |
11 | 633134032 |
12 | 3181aaab3 |
13 | 186941bcb |
14 | cb453663 |
15 | 7d7e6660 |
hex | 50797fa7 |
1350139815 has 12 divisors (see below), whose sum is σ = 2340242424. Its totient is φ = 720074544.
The previous prime is 1350139811. The next prime is 1350139823. The reversal of 1350139815 is 5189310531.
It is not a de Polignac number, because 1350139815 - 22 = 1350139811 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1350139815.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1350139811) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 15001509 + ... + 15001598.
It is an arithmetic number, because the mean of its divisors is an integer number (195020202).
Almost surely, 21350139815 is an apocalyptic number.
1350139815 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1350139815 is a deficient number, since it is larger than the sum of its proper divisors (990102609).
1350139815 is a wasteful number, since it uses less digits than its factorization.
1350139815 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30003118 (or 30003115 counting only the distinct ones).
The product of its (nonzero) digits is 16200, while the sum is 36.
The square root of 1350139815 is about 36744.2487336454. The cubic root of 1350139815 is about 1105.2476025612.
The spelling of 1350139815 in words is "one billion, three hundred fifty million, one hundred thirty-nine thousand, eight hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •