Base | Representation |
---|---|
bin | 10101010011101011101… |
… | …000000000001111001101 |
3 | 12011222110112200012021121 |
4 | 111103223220000033031 |
5 | 142442231423410013 |
6 | 3040355152000541 |
7 | 210534165516664 |
oct | 25235350001715 |
9 | 5158415605247 |
10 | 1464242013133 |
11 | 514a88497629 |
12 | 1b7943830151 |
13 | a810115c9b3 |
14 | 50c2660dddb |
15 | 2814cee058d |
hex | 154eba003cd |
1464242013133 has 8 divisors (see below), whose sum is σ = 1485020007680. Its totient is φ = 1443520100880.
The previous prime is 1464242013119. The next prime is 1464242013149. The reversal of 1464242013133 is 3313102424641.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1464242013133 - 225 = 1464208458701 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1464242013173) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13967985 + ... + 14072422.
It is an arithmetic number, because the mean of its divisors is an integer number (185627500960).
Almost surely, 21464242013133 is an apocalyptic number.
It is an amenable number.
1464242013133 is a deficient number, since it is larger than the sum of its proper divisors (20777994547).
1464242013133 is an equidigital number, since it uses as much as digits as its factorization.
1464242013133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28041147.
The product of its (nonzero) digits is 41472, while the sum is 34.
Adding to 1464242013133 its reverse (3313102424641), we get a palindrome (4777344437774).
The spelling of 1464242013133 in words is "one trillion, four hundred sixty-four billion, two hundred forty-two million, thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •