Base | Representation |
---|---|
bin | 10010111101100111100… |
… | …110011100010001011101 |
3 | 11121120120012102110212112 |
4 | 102331213212130101131 |
5 | 132322233441034323 |
6 | 2434350354443405 |
7 | 163101234423146 |
oct | 22754746342135 |
9 | 4546505373775 |
10 | 1303113221213 |
11 | 462713494391 |
12 | 190675b93565 |
13 | 95b630a127b |
14 | 470dcc24acd |
15 | 23d6c3d1178 |
hex | 12f6799c45d |
1303113221213 has 8 divisors (see below), whose sum is σ = 1338346808832. Its totient is φ = 1267880386896.
The previous prime is 1303113221209. The next prime is 1303113221231. The reversal of 1303113221213 is 3121223113031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1303113221213 - 22 = 1303113221209 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 (1303113221273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6291956 + ... + 6495762.
It is an arithmetic number, because the mean of its divisors is an integer number (167293351104).
Almost surely, 21303113221213 is an apocalyptic number.
It is an amenable number.
1303113221213 is a deficient number, since it is larger than the sum of its proper divisors (35233587619).
1303113221213 is a wasteful number, since it uses less digits than its factorization.
1303113221213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 376651.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 1303113221213 its reverse (3121223113031), we get a palindrome (4424336334244).
The spelling of 1303113221213 in words is "one trillion, three hundred three billion, one hundred thirteen million, two hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •