Base | Representation |
---|---|
bin | 10010111101101110100… |
… | …111110001100110010111 |
3 | 11121120212102001211101111 |
4 | 102331232213301212113 |
5 | 132323004114324343 |
6 | 2434410203235451 |
7 | 163104164551231 |
oct | 22755647614627 |
9 | 4546772054344 |
10 | 1303231011223 |
11 | 462773a267a9 |
12 | 1906a9518b87 |
13 | 95b816032bb |
14 | 47110727251 |
15 | 23d778ebc9d |
hex | 12f6e9f1997 |
1303231011223 has 12 divisors (see below), whose sum is σ = 1429114920480. Its totient is φ = 1184274820736.
The previous prime is 1303231011221. The next prime is 1303231011289. The reversal of 1303231011223 is 3221101323031.
It is not a de Polignac number, because 1303231011223 - 21 = 1303231011221 is a prime.
It is a super-2 number, since 2×13032310112232 (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 = 1303231011194 and 1303231011203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1303231011221) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 45562783 + ... + 45591376.
It is an arithmetic number, because the mean of its divisors is an integer number (119092910040).
Almost surely, 21303231011223 is an apocalyptic number.
1303231011223 is a deficient number, since it is larger than the sum of its proper divisors (125883909257).
1303231011223 is an equidigital number, since it uses as much as digits as its factorization.
1303231011223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91154234 (or 91154205 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 1303231011223 its reverse (3221101323031), we get a palindrome (4524332334254).
The spelling of 1303231011223 in words is "one trillion, three hundred three billion, two hundred thirty-one million, eleven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •