Base | Representation |
---|---|
bin | 100111101010001… |
… | …0001011011110101 |
3 | 10102201222021220221 |
4 | 1033110101123311 |
5 | 10211130324412 |
6 | 340013454341 |
7 | 44655612460 |
oct | 11724213365 |
9 | 3381867827 |
10 | 1330714357 |
11 | 623176435 |
12 | 3117a13b1 |
13 | 18290015b |
14 | c8a382d7 |
15 | 7bc5ab07 |
hex | 4f5116f5 |
1330714357 has 4 divisors (see below), whose sum is σ = 1520816416. Its totient is φ = 1140612300.
The previous prime is 1330714313. The next prime is 1330714369. The reversal of 1330714357 is 7534170331.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1330714357 - 215 = 1330681589 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1330714397) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 95051019 + ... + 95051032.
It is an arithmetic number, because the mean of its divisors is an integer number (380204104).
Almost surely, 21330714357 is an apocalyptic number.
It is an amenable number.
1330714357 is a deficient number, since it is larger than the sum of its proper divisors (190102059).
1330714357 is an equidigital number, since it uses as much as digits as its factorization.
1330714357 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190102058.
The product of its (nonzero) digits is 26460, while the sum is 34.
The square root of 1330714357 is about 36478.9577290799. The cubic root of 1330714357 is about 1099.9213048385.
Adding to 1330714357 its reverse (7534170331), we get a palindrome (8864884688).
The spelling of 1330714357 in words is "one billion, three hundred thirty million, seven hundred fourteen thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •