Base | Representation |
---|---|
bin | 101000000111100… |
… | …0110010100001011 |
3 | 10110210222202111020 |
4 | 1100033012110023 |
5 | 10224102312212 |
6 | 341324203523 |
7 | 45233650506 |
oct | 12017062413 |
9 | 3423882436 |
10 | 1346135307 |
11 | 630949420 |
12 | 3169995a3 |
13 | 185b6c28a |
14 | caad013d |
15 | 7d2a4d8c |
hex | 503c650b |
1346135307 has 8 divisors (see below), whose sum is σ = 1958015040. Its totient is φ = 815839560.
The previous prime is 1346135303. The next prime is 1346135341. The reversal of 1346135307 is 7035316431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1346135307 - 22 = 1346135303 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 40791979 = 1346135307 / (1 + 3 + 4 + 6 + 1 + 3 + 5 + 3 + 0 + 7).
It is not an unprimeable number, because it can be changed into a prime (1346135303) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 20395957 + ... + 20396022.
It is an arithmetic number, because the mean of its divisors is an integer number (244751880).
Almost surely, 21346135307 is an apocalyptic number.
1346135307 is a deficient number, since it is larger than the sum of its proper divisors (611879733).
1346135307 is a wasteful number, since it uses less digits than its factorization.
1346135307 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40791993.
The product of its (nonzero) digits is 22680, while the sum is 33.
The square root of 1346135307 is about 36689.7166383171. The cubic root of 1346135307 is about 1104.1538008067.
The spelling of 1346135307 in words is "one billion, three hundred forty-six million, one hundred thirty-five thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •