Base | Representation |
---|---|
bin | 101000011100100… |
… | …0111001001011001 |
3 | 10111120201022002221 |
4 | 1100321013021121 |
5 | 10234412230021 |
6 | 342400224041 |
7 | 45426400633 |
oct | 12071071131 |
9 | 3446638087 |
10 | 1357148761 |
11 | 637090a51 |
12 | 31a60b021 |
13 | 188227207 |
14 | cc359a53 |
15 | 7e22d241 |
hex | 50e47259 |
1357148761 has 4 divisors (see below), whose sum is σ = 1357223092. Its totient is φ = 1357074432.
The previous prime is 1357148753. The next prime is 1357148839. The reversal of 1357148761 is 1678417531.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 162409536 + 1194739225 = 12744^2 + 34565^2 .
It is a cyclic number.
It is not a de Polignac number, because 1357148761 - 23 = 1357148753 is a prime.
It is the 36840-th Hogben number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1357148561) by changing a digit.
It is a nontrivial repunit in base 36839.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11221 + ... + 53293.
It is an arithmetic number, because the mean of its divisors is an integer number (339305773).
Almost surely, 21357148761 is an apocalyptic number.
It is an amenable number.
1357148761 is a deficient number, since it is larger than the sum of its proper divisors (74331).
1357148761 is an equidigital number, since it uses as much as digits as its factorization.
1357148761 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 74330.
The product of its digits is 141120, while the sum is 43.
The square root of 1357148761 is about 36839.5000101793. The cubic root of 1357148761 is about 1107.1568503443.
The spelling of 1357148761 in words is "one billion, three hundred fifty-seven million, one hundred forty-eight thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •