Base | Representation |
---|---|
bin | 10010111101100110111… |
… | …111111100111001001101 |
3 | 11121120112111102211222211 |
4 | 102331212333330321031 |
5 | 132322223400144323 |
6 | 2434345354310421 |
7 | 163101052600222 |
oct | 22754677747115 |
9 | 4546474384884 |
10 | 1303103131213 |
11 | 462708822644 |
12 | 190672728411 |
13 | 95b60c7a760 |
14 | 470db759949 |
15 | 23d6b58b70d |
hex | 12f66ffce4d |
1303103131213 has 16 divisors (see below), whose sum is σ = 1477257819520. Its totient is φ = 1139512660416.
The previous prime is 1303103131201. The next prime is 1303103131229. The reversal of 1303103131213 is 3121313013031.
It is not a de Polignac number, because 1303103131213 - 229 = 1302566260301 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1303103131243) 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, 7661056 + ... + 7829302.
It is an arithmetic number, because the mean of its divisors is an integer number (92328613720).
Almost surely, 21303103131213 is an apocalyptic number.
1303103131213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1303103131213 is a deficient number, since it is larger than the sum of its proper divisors (174154688307).
1303103131213 is a wasteful number, since it uses less digits than its factorization.
1303103131213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 199636.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 1303103131213 its reverse (3121313013031), we get a palindrome (4424416144244).
The spelling of 1303103131213 in words is "one trillion, three hundred three billion, one hundred three million, one hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •