Base | Representation |
---|---|
bin | 1001001100000101000110… |
… | …1011000101111101100111 |
3 | 1022202211221201210022120121 |
4 | 2103001101223011331213 |
5 | 2311012204113100203 |
6 | 33253152042142411 |
7 | 2061633030242425 |
oct | 223012153057547 |
9 | 38684851708517 |
10 | 10103133331303 |
11 | 3245795417321 |
12 | 117207aab1a07 |
13 | 58394bb6334c |
14 | 26cdcc382115 |
15 | 127c142ac0bd |
hex | 93051ac5f67 |
10103133331303 has 2 divisors, whose sum is σ = 10103133331304. Its totient is φ = 10103133331302.
The previous prime is 10103133331223. The next prime is 10103133331337. The reversal of 10103133331303 is 30313333130101.
10103133331303 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10103133331303 is a prime.
It is a super-2 number, since 2×101031333313032 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10103133331703) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5051566665651 + 5051566665652.
It is an arithmetic number, because the mean of its divisors is an integer number (5051566665652).
Almost surely, 210103133331303 is an apocalyptic number.
10103133331303 is a deficient number, since it is larger than the sum of its proper divisors (1).
10103133331303 is an equidigital number, since it uses as much as digits as its factorization.
10103133331303 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2187, while the sum is 25.
Adding to 10103133331303 its reverse (30313333130101), we get a palindrome (40416466461404).
The spelling of 10103133331303 in words is "ten trillion, one hundred three billion, one hundred thirty-three million, three hundred thirty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •