Base | Representation |
---|---|
bin | 1001001100000101101111… |
… | …0010110000101001011111 |
3 | 1022202212101120021010201010 |
4 | 2103001123302300221133 |
5 | 2311013031044111221 |
6 | 33253220545150303 |
7 | 2061640161332622 |
oct | 223013362605137 |
9 | 38685346233633 |
10 | 10103303113311 |
11 | 3245872240031 |
12 | 117210792b393 |
13 | 58397809a385 |
14 | 26d006b39db9 |
15 | 127c24147c76 |
hex | 9305bcb0a5f |
10103303113311 has 8 divisors (see below), whose sum is σ = 13471742738304. Its totient is φ = 6735199448600.
The previous prime is 10103303113307. The next prime is 10103303113327. The reversal of 10103303113311 is 11331130330101.
10103303113311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10103303113311 - 22 = 10103303113307 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10103303113391) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 83919891 + ... + 84040196.
It is an arithmetic number, because the mean of its divisors is an integer number (1683967842288).
Almost surely, 210103303113311 is an apocalyptic number.
10103303113311 is a deficient number, since it is larger than the sum of its proper divisors (3368439624993).
10103303113311 is a wasteful number, since it uses less digits than its factorization.
10103303113311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 167980141.
The product of its (nonzero) digits is 243, while the sum is 21.
Adding to 10103303113311 its reverse (11331130330101), we get a palindrome (21434433443412).
The spelling of 10103303113311 in words is "ten trillion, one hundred three billion, three hundred three million, one hundred thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •