Base | Representation |
---|---|
bin | 101000011010101… |
… | …0011101001000001 |
3 | 10111111211121221012 |
4 | 1100311103221001 |
5 | 10234133320421 |
6 | 342323010305 |
7 | 45415045025 |
oct | 12065235101 |
9 | 3444747835 |
10 | 1356151361 |
11 | 63656a654 |
12 | 31a209995 |
13 | 187c68236 |
14 | cc17a385 |
15 | 7e0d295b |
hex | 50d53a41 |
1356151361 has 4 divisors (see below), whose sum is σ = 1364471472. Its totient is φ = 1347831252.
The previous prime is 1356151297. The next prime is 1356151393. The reversal of 1356151361 is 1631516531.
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 1356151361 - 26 = 1356151297 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1356151561) 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 3 ways as a sum of consecutive naturals, for example, 4159811 + ... + 4160136.
It is an arithmetic number, because the mean of its divisors is an integer number (341117868).
Almost surely, 21356151361 is an apocalyptic number.
It is an amenable number.
1356151361 is a deficient number, since it is larger than the sum of its proper divisors (8320111).
1356151361 is an equidigital number, since it uses as much as digits as its factorization.
1356151361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8320110.
The product of its digits is 8100, while the sum is 32.
The square root of 1356151361 is about 36825.9604219632. The cubic root of 1356151361 is about 1106.8855588189.
Adding to 1356151361 its reverse (1631516531), we get a palindrome (2987667892).
The spelling of 1356151361 in words is "one billion, three hundred fifty-six million, one hundred fifty-one thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •