Base | Representation |
---|---|
bin | 101000100000100… |
… | …0111000001101001 |
3 | 10111201122211011212 |
4 | 1101001013001221 |
5 | 10240431323132 |
6 | 342513202505 |
7 | 45453252425 |
oct | 12101070151 |
9 | 3451584155 |
10 | 1359245417 |
11 | 638293222 |
12 | 31b260435 |
13 | 1887ac63a |
14 | cc743b85 |
15 | 7e4e45b2 |
hex | 51047069 |
1359245417 has 4 divisors (see below), whose sum is σ = 1359319680. Its totient is φ = 1359171156.
The previous prime is 1359245413. The next prime is 1359245423. The reversal of 1359245417 is 7145429531.
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, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 1359245417 - 22 = 1359245413 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1359245411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11948 + ... + 53490.
It is an arithmetic number, because the mean of its divisors is an integer number (339829920).
Almost surely, 21359245417 is an apocalyptic number.
It is an amenable number.
1359245417 is a deficient number, since it is larger than the sum of its proper divisors (74263).
1359245417 is an equidigital number, since it uses as much as digits as its factorization.
1359245417 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74262.
The product of its digits is 151200, while the sum is 41.
The square root of 1359245417 is about 36867.9456574407. The cubic root of 1359245417 is about 1107.7267050133.
The spelling of 1359245417 in words is "one billion, three hundred fifty-nine million, two hundred forty-five thousand, four hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •