Base | Representation |
---|---|
bin | 10010111101100000111… |
… | …110010010001110100101 |
3 | 11121120021110012102120222 |
4 | 102331200332102032211 |
5 | 132322022004443023 |
6 | 2434331343334125 |
7 | 163065414343364 |
oct | 22754076221645 |
9 | 4546243172528 |
10 | 1303002031013 |
11 | 46266674a561 |
12 | 1906448b1345 |
13 | 95b46040257 |
14 | 470cc15d7db |
15 | 23d6276acc8 |
hex | 12f60f923a5 |
1303002031013 has 16 divisors (see below), whose sum is σ = 1341457943280. Its totient is φ = 1265165568000.
The previous prime is 1303002030989. The next prime is 1303002031081. The reversal of 1303002031013 is 3101302003031.
It can be written as a sum of positive squares in 8 ways, for example, as 208170450049 + 1094831580964 = 456257^2 + 1046342^2 .
It is not a de Polignac number, because 1303002031013 - 228 = 1302733595557 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1303002030982 and 1303002031000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1303002031213) 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, 2018663 + ... + 2584763.
It is an arithmetic number, because the mean of its divisors is an integer number (83841121455).
Almost surely, 21303002031013 is an apocalyptic number.
It is an amenable number.
1303002031013 is a deficient number, since it is larger than the sum of its proper divisors (38455912267).
1303002031013 is an equidigital number, since it uses as much as digits as its factorization.
1303002031013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 566648.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 1303002031013 its reverse (3101302003031), we get a palindrome (4404304034044).
The spelling of 1303002031013 in words is "one trillion, three hundred three billion, two million, thirty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •