Base | Representation |
---|---|
bin | 10000110000011101010… |
… | …111111100101011011001 |
3 | 11002002100002021221010001 |
4 | 100300131113330223121 |
5 | 122331330234134231 |
6 | 2241002333253001 |
7 | 146124222641626 |
oct | 20603527745331 |
9 | 4062302257101 |
10 | 1151544052441 |
11 | 404404662542 |
12 | 167215934161 |
13 | 847896c24a3 |
14 | 3da40cc734d |
15 | 1ee4ab92b61 |
hex | 10c1d5fcad9 |
1151544052441 has 4 divisors (see below), whose sum is σ = 1153245004452. Its totient is φ = 1149843100432.
The previous prime is 1151544052427. The next prime is 1151544052501. The reversal of 1151544052441 is 1442504451511.
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 761788568025 + 389755484416 = 872805^2 + 624304^2 .
It is a cyclic number.
It is not a de Polignac number, because 1151544052441 - 25 = 1151544052409 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1151544052441.
It is not an unprimeable number, because it can be changed into a prime (1151544050441) 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, 850474990 + ... + 850476343.
It is an arithmetic number, because the mean of its divisors is an integer number (288311251113).
Almost surely, 21151544052441 is an apocalyptic number.
It is an amenable number.
1151544052441 is a deficient number, since it is larger than the sum of its proper divisors (1700952011).
1151544052441 is an equidigital number, since it uses as much as digits as its factorization.
1151544052441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1700952010.
The product of its (nonzero) digits is 64000, while the sum is 37.
The spelling of 1151544052441 in words is "one trillion, one hundred fifty-one billion, five hundred forty-four million, fifty-two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •