Base | Representation |
---|---|
bin | 10000011010101011011… |
… | …011111001111000110001 |
3 | 10222211222020122121200111 |
4 | 100122223123321320301 |
5 | 121440431324303411 |
6 | 2222133553421321 |
7 | 144335540544001 |
oct | 20325333717061 |
9 | 3884866577614 |
10 | 1128157650481 |
11 | 3a54a3645614 |
12 | 16278986a841 |
13 | 82500573214 |
14 | 3c862d74001 |
15 | 1e52c9a8721 |
hex | 106ab6f9e31 |
1128157650481 has 4 divisors (see below), whose sum is σ = 1128407634532. Its totient is φ = 1127907666432.
The previous prime is 1128157650479. The next prime is 1128157650497. The reversal of 1128157650481 is 1840567518211.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 163458490000 + 964699160481 = 404300^2 + 982191^2 .
It is a cyclic number.
It is not a de Polignac number, because 1128157650481 - 21 = 1128157650479 is a prime.
It is a super-2 number, since 2×11281576504812 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1128157650281) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 124985256 + ... + 124994281.
It is an arithmetic number, because the mean of its divisors is an integer number (282101908633).
Almost surely, 21128157650481 is an apocalyptic number.
It is an amenable number.
1128157650481 is a deficient number, since it is larger than the sum of its proper divisors (249984051).
1128157650481 is an equidigital number, since it uses as much as digits as its factorization.
1128157650481 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 249984050.
The product of its (nonzero) digits is 537600, while the sum is 49.
The spelling of 1128157650481 in words is "one trillion, one hundred twenty-eight billion, one hundred fifty-seven million, six hundred fifty thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •