Base | Representation |
---|---|
bin | 10011000100100010111… |
… | …100111000101010010110 |
3 | 11122021202120200200112010 |
4 | 103010202330320222112 |
5 | 132433002130130400 |
6 | 2442020425005050 |
7 | 163453454123526 |
oct | 23044274705226 |
9 | 4567676620463 |
10 | 1310551411350 |
11 | 465890118765 |
12 | 191bb1023786 |
13 | 9677a0ca5cc |
14 | 47606a47686 |
15 | 24155404450 |
hex | 13122f38a96 |
1310551411350 has 24 divisors (see below), whose sum is σ = 3250167500520. Its totient is φ = 349480376320.
The previous prime is 1310551411331. The next prime is 1310551411361. The reversal of 1310551411350 is 531141550131.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 4368504555 + ... + 4368504854.
It is an arithmetic number, because the mean of its divisors is an integer number (135423645855).
Almost surely, 21310551411350 is an apocalyptic number.
1310551411350 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1310551411350 is an abundant number, since it is smaller than the sum of its proper divisors (1939616089170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1310551411350 is a wasteful number, since it uses less digits than its factorization.
1310551411350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8737009424 (or 8737009419 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 30.
Adding to 1310551411350 its reverse (531141550131), we get a palindrome (1841692961481).
The spelling of 1310551411350 in words is "one trillion, three hundred ten billion, five hundred fifty-one million, four hundred eleven thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •