Base | Representation |
---|---|
bin | 101000001110111… |
… | …1000010100000011 |
3 | 10111002021121201122 |
4 | 1100131320110003 |
5 | 10231100310430 |
6 | 341543222455 |
7 | 45311616356 |
oct | 12035702403 |
9 | 3432247648 |
10 | 1350010115 |
11 | 633055643 |
12 | 318147a2b |
13 | 1868c7b6c |
14 | cb41c29d |
15 | 7d7bcee5 |
hex | 50778503 |
1350010115 has 4 divisors (see below), whose sum is σ = 1620012144. Its totient is φ = 1080008088.
The previous prime is 1350010091. The next prime is 1350010121. The reversal of 1350010115 is 5110100531.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 5110100531 = 131 ⋅39008401.
It is a cyclic number.
It is not a de Polignac number, because 1350010115 - 220 = 1348961539 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1350010093 and 1350010102.
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 3 ways as a sum of consecutive naturals, for example, 135001007 + ... + 135001016.
It is an arithmetic number, because the mean of its divisors is an integer number (405003036).
Almost surely, 21350010115 is an apocalyptic number.
1350010115 is a deficient number, since it is larger than the sum of its proper divisors (270002029).
1350010115 is an equidigital number, since it uses as much as digits as its factorization.
1350010115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 270002028.
The product of its (nonzero) digits is 75, while the sum is 17.
The square root of 1350010115 is about 36742.4837892051. The cubic root of 1350010115 is about 1105.2122098799.
Adding to 1350010115 its reverse (5110100531), we get a palindrome (6460110646).
The spelling of 1350010115 in words is "one billion, three hundred fifty million, ten thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •