Base | Representation |
---|---|
bin | 10010111101110101110… |
… | …110111011011001011111 |
3 | 11121121011212112020110011 |
4 | 102331311312323121133 |
5 | 132323231210032111 |
6 | 2434430221424051 |
7 | 163110200545360 |
oct | 22756566733137 |
9 | 4547155466404 |
10 | 1303352424031 |
11 | 462826512a69 |
12 | 19072210b027 |
13 | 95ba08032b8 |
14 | 471228cdb67 |
15 | 23d833d1021 |
hex | 12f75dbb65f |
1303352424031 has 16 divisors (see below), whose sum is σ = 1555267650048. Its totient is φ = 1067927652000.
The previous prime is 1303352423969. The next prime is 1303352424043. The reversal of 1303352424031 is 1304242533031.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1303352424031 - 29 = 1303352423519 is a prime.
It is a super-2 number, since 2×13033524240312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1303352423984 and 1303352424002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1303352424091) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2236045 + ... + 2758006.
It is an arithmetic number, because the mean of its divisors is an integer number (97204228128).
Almost surely, 21303352424031 is an apocalyptic number.
1303352424031 is a deficient number, since it is larger than the sum of its proper divisors (251915226017).
1303352424031 is a wasteful number, since it uses less digits than its factorization.
1303352424031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4995702.
The product of its (nonzero) digits is 25920, while the sum is 31.
Adding to 1303352424031 its reverse (1304242533031), we get a palindrome (2607594957062).
The spelling of 1303352424031 in words is "one trillion, three hundred three billion, three hundred fifty-two million, four hundred twenty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •