Base | Representation |
---|---|
bin | 10011000100001010011… |
… | …100011010000101110111 |
3 | 11122020200221000020102110 |
4 | 103010022130122011313 |
5 | 132431131400304333 |
6 | 2441511540142103 |
7 | 163440332222100 |
oct | 23041234320567 |
9 | 4566627006373 |
10 | 1310140244343 |
11 | 46569a015917 |
12 | 191ab7397933 |
13 | 96712b79218 |
14 | 475a81b73a7 |
15 | 2412e287063 |
hex | 1310a71a177 |
1310140244343 has 48 divisors (see below), whose sum is σ = 2075758876800. Its totient is φ = 732718494144.
The previous prime is 1310140244339. The next prime is 1310140244359. The reversal of 1310140244343 is 3434420410131.
It is not a de Polignac number, because 1310140244343 - 22 = 1310140244339 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1310140244343.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1310140243343) 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 47 ways as a sum of consecutive naturals, for example, 803733 + ... + 1807281.
It is an arithmetic number, because the mean of its divisors is an integer number (43244976600).
Almost surely, 21310140244343 is an apocalyptic number.
1310140244343 is a deficient number, since it is larger than the sum of its proper divisors (765618632457).
1310140244343 is a wasteful number, since it uses less digits than its factorization.
1310140244343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1003756 (or 1003749 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 1310140244343 its reverse (3434420410131), we get a palindrome (4744560654474).
The spelling of 1310140244343 in words is "one trillion, three hundred ten billion, one hundred forty million, two hundred forty-four thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •