Base | Representation |
---|---|
bin | 10011001100010000… |
… | …00000111000110101 |
3 | 222121001111110011102 |
4 | 21212020000320311 |
5 | 132100121431123 |
6 | 4422215415445 |
7 | 513216462533 |
oct | 114610007065 |
9 | 28531443142 |
10 | 10303311413 |
11 | 4407a503aa |
12 | 1bb6684585 |
13 | c827a7595 |
14 | 6da559153 |
15 | 404823028 |
hex | 266200e35 |
10303311413 has 4 divisors (see below), whose sum is σ = 10320455628. Its totient is φ = 10286167200.
The previous prime is 10303311401. The next prime is 10303311427. The reversal of 10303311413 is 31411330301.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3674420689 + 6628890724 = 60617^2 + 81418^2 .
It is a cyclic number.
It is not a de Polignac number, because 10303311413 - 210 = 10303310389 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 (10303311443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8571206 + ... + 8572407.
It is an arithmetic number, because the mean of its divisors is an integer number (2580113907).
Almost surely, 210303311413 is an apocalyptic number.
It is an amenable number.
10303311413 is a deficient number, since it is larger than the sum of its proper divisors (17144215).
10303311413 is an equidigital number, since it uses as much as digits as its factorization.
10303311413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17144214.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 10303311413 its reverse (31411330301), we get a palindrome (41714641714).
The spelling of 10303311413 in words is "ten billion, three hundred three million, three hundred eleven thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •