Base | Representation |
---|---|
bin | 10010111101100110111… |
… | …100001000110010000011 |
3 | 11121120112102120001102011 |
4 | 102331212330020302003 |
5 | 132322223121200311 |
6 | 2434345321033351 |
7 | 163101041234140 |
oct | 22754674106203 |
9 | 4546472501364 |
10 | 1303102131331 |
11 | 4627081aa3a0 |
12 | 190672325857 |
13 | 95b609ba600 |
14 | 470db5793c7 |
15 | 23d6b440321 |
hex | 12f66f08c83 |
1303102131331 has 24 divisors (see below), whose sum is σ = 1759232957184. Its totient is φ = 937296228960.
The previous prime is 1303102131329. The next prime is 1303102131341. The reversal of 1303102131331 is 1331312013031.
It is not a de Polignac number, because 1303102131331 - 21 = 1303102131329 is a prime.
It is a super-2 number, since 2×13031021313312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1303102131341) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 50056231 + ... + 50082256.
It is an arithmetic number, because the mean of its divisors is an integer number (73301373216).
Almost surely, 21303102131331 is an apocalyptic number.
1303102131331 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1303102131331 is a deficient number, since it is larger than the sum of its proper divisors (456130825853).
1303102131331 is a wasteful number, since it uses less digits than its factorization.
1303102131331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100138531 (or 100138518 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 1303102131331 its reverse (1331312013031), we get a palindrome (2634414144362).
The spelling of 1303102131331 in words is "one trillion, three hundred three billion, one hundred two million, one hundred thirty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •