Base | Representation |
---|---|
bin | 10010111101101101111… |
… | …101110001110011011101 |
3 | 11121120211122100111120222 |
4 | 102331231331301303131 |
5 | 132322443310031023 |
6 | 2434405131251125 |
7 | 163104002146346 |
oct | 22755575616335 |
9 | 4546748314528 |
10 | 1303220002013 |
11 | 462768797386 |
12 | 1906a58a9aa5 |
13 | 95b7c24a287 |
14 | 4710d09d0cd |
15 | 23d76974cc8 |
hex | 12f6df71cdd |
1303220002013 has 4 divisors (see below), whose sum is σ = 1313481576960. Its totient is φ = 1292958427068.
The previous prime is 1303220001977. The next prime is 1303220002033. The reversal of 1303220002013 is 3102000223031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1303220002013 - 214 = 1303219985629 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1303220001982 and 1303220002000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1303220002033) 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, 5130787283 + ... + 5130787536.
It is an arithmetic number, because the mean of its divisors is an integer number (328370394240).
Almost surely, 21303220002013 is an apocalyptic number.
It is an amenable number.
1303220002013 is a deficient number, since it is larger than the sum of its proper divisors (10261574947).
1303220002013 is a wasteful number, since it uses less digits than its factorization.
1303220002013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10261574946.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 1303220002013 its reverse (3102000223031), we get a palindrome (4405220225044).
The spelling of 1303220002013 in words is "one trillion, three hundred three billion, two hundred twenty million, two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •