Base | Representation |
---|---|
bin | 10011000100011011001… |
… | …100001101100100100000 |
3 | 11122021102111200211210122 |
4 | 103010123030031210200 |
5 | 132432220312231144 |
6 | 2441555454215412 |
7 | 163450313341103 |
oct | 23043314154440 |
9 | 4567374624718 |
10 | 1310421211424 |
11 | 46582367a616 |
12 | 191b754b4568 |
13 | 96759141b30 |
14 | 475d363473a |
15 | 24148c867ee |
hex | 1311b30d920 |
1310421211424 has 48 divisors (see below), whose sum is σ = 2941777045368. Its totient is φ = 569232740352.
The previous prime is 1310421211423. The next prime is 1310421211433. The reversal of 1310421211424 is 4241121240131.
It can be written as a sum of positive squares in 4 ways, for example, as 1017233616400 + 293187595024 = 1008580^2 + 541468^2 .
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a junction number, because it is equal to n+sod(n) for n = 1310421211393 and 1310421211402.
It is not an unprimeable number, because it can be changed into a prime (1310421211423) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 92641487 + ... + 92655630.
Almost surely, 21310421211424 is an apocalyptic number.
It is an amenable number.
1310421211424 is an abundant number, since it is smaller than the sum of its proper divisors (1631355833944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1310421211424 is a wasteful number, since it uses less digits than its factorization.
1310421211424 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 185297157 (or 185297149 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 26.
Adding to 1310421211424 its reverse (4241121240131), we get a palindrome (5551542451555).
The spelling of 1310421211424 in words is "one trillion, three hundred ten billion, four hundred twenty-one million, two hundred eleven thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •