Base | Representation |
---|---|
bin | 10101010111101100000… |
… | …101011111011100101001 |
3 | 12012101120101221212101011 |
4 | 111113230011133130221 |
5 | 143030034421213231 |
6 | 3042350133423521 |
7 | 211045623036004 |
oct | 25275405373451 |
9 | 5171511855334 |
10 | 1468544710441 |
11 | 516896227816 |
12 | 1b874479aba1 |
13 | a86386b4b33 |
14 | 51113c3a53b |
15 | 28300b089b1 |
hex | 155ec15f729 |
1468544710441 has 4 divisors (see below), whose sum is σ = 1468547180884. Its totient is φ = 1468542240000.
The previous prime is 1468544710427. The next prime is 1468544710453. The reversal of 1468544710441 is 1440174458641.
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 168123780841 + 1300420929600 = 410029^2 + 1140360^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1468544710441 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1468544710471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 258781 + ... + 1733221.
It is an arithmetic number, because the mean of its divisors is an integer number (367136795221).
Almost surely, 21468544710441 is an apocalyptic number.
It is an amenable number.
1468544710441 is a deficient number, since it is larger than the sum of its proper divisors (2470443).
1468544710441 is an equidigital number, since it uses as much as digits as its factorization.
1468544710441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2470442.
The product of its (nonzero) digits is 1720320, while the sum is 49.
The spelling of 1468544710441 in words is "one trillion, four hundred sixty-eight billion, five hundred forty-four million, seven hundred ten thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •