Base | Representation |
---|---|
bin | 11000011001111011… |
… | …10100010000010111 |
3 | 1020211010112120112112 |
4 | 30030331310100113 |
5 | 203313210331203 |
6 | 10004050341235 |
7 | 642455563001 |
oct | 141475642027 |
9 | 36733476475 |
10 | 13102433303 |
11 | 5613a89083 |
12 | 2657b8a81b |
13 | 130a687c1b |
14 | 8c41d1371 |
15 | 51a4376d8 |
hex | 30cf74417 |
13102433303 has 4 divisors (see below), whose sum is σ = 13456553160. Its totient is φ = 12748313448.
The previous prime is 13102433297. The next prime is 13102433327. The reversal of 13102433303 is 30333420131.
13102433303 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13102433303 - 24 = 13102433287 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 (13102433353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 177059873 + ... + 177059946.
It is an arithmetic number, because the mean of its divisors is an integer number (3364138290).
Almost surely, 213102433303 is an apocalyptic number.
13102433303 is a deficient number, since it is larger than the sum of its proper divisors (354119857).
13102433303 is an equidigital number, since it uses as much as digits as its factorization.
13102433303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 354119856.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 13102433303 its reverse (30333420131), we get a palindrome (43435853434).
The spelling of 13102433303 in words is "thirteen billion, one hundred two million, four hundred thirty-three thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •