Base | Representation |
---|---|
bin | 10010111101100010101… |
… | …100110101101100100011 |
3 | 11121120100110201211012201 |
4 | 102331202230311230203 |
5 | 132322101414342011 |
6 | 2434334300434031 |
7 | 163066215566422 |
oct | 22754254655443 |
9 | 4546313654181 |
10 | 1303031012131 |
11 | 4626810444a2 |
12 | 190652548917 |
13 | 95b4c049544 |
14 | 470d1d452b9 |
15 | 23d65092cc1 |
hex | 12f62b35b23 |
1303031012131 has 4 divisors (see below), whose sum is σ = 1303033723200. Its totient is φ = 1303028301064.
The previous prime is 1303031012123. The next prime is 1303031012147. The reversal of 1303031012131 is 1312101303031.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1303031012131 - 23 = 1303031012123 is a prime.
It is a super-2 number, since 2×13030310121312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1303031012099 and 1303031012108.
It is not an unprimeable number, because it can be changed into a prime (1303031012111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 418816 + ... + 1667773.
It is an arithmetic number, because the mean of its divisors is an integer number (325758430800).
Almost surely, 21303031012131 is an apocalyptic number.
1303031012131 is a deficient number, since it is larger than the sum of its proper divisors (2711069).
1303031012131 is an equidigital number, since it uses as much as digits as its factorization.
1303031012131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2711068.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 1303031012131 its reverse (1312101303031), we get a palindrome (2615132315162).
The spelling of 1303031012131 in words is "one trillion, three hundred three billion, thirty-one million, twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •