Base | Representation |
---|---|
bin | 1001010111100011001111… |
… | …1100101110000111000101 |
3 | 1100110200121212101102101012 |
4 | 2111320303330232013011 |
5 | 2322224304000200313 |
6 | 33523503100012005 |
7 | 2112110431015403 |
oct | 225706374560705 |
9 | 40420555342335 |
10 | 10300203131333 |
11 | 3311323161955 |
12 | 11a42b9231005 |
13 | 5993c709978b |
14 | 27876522a473 |
15 | 12cdea378da8 |
hex | 95e33f2e1c5 |
10300203131333 has 2 divisors, whose sum is σ = 10300203131334. Its totient is φ = 10300203131332.
The previous prime is 10300203131291. The next prime is 10300203131341. The reversal of 10300203131333 is 33313130200301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9487280900449 + 812922230884 = 3080143^2 + 901622^2 .
It is a cyclic number.
It is not a de Polignac number, because 10300203131333 - 218 = 10300202869189 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10300203131299 and 10300203131308.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10300203131033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5150101565666 + 5150101565667.
It is an arithmetic number, because the mean of its divisors is an integer number (5150101565667).
Almost surely, 210300203131333 is an apocalyptic number.
It is an amenable number.
10300203131333 is a deficient number, since it is larger than the sum of its proper divisors (1).
10300203131333 is an equidigital number, since it uses as much as digits as its factorization.
10300203131333 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 10300203131333 its reverse (33313130200301), we get a palindrome (43613333331634).
The spelling of 10300203131333 in words is "ten trillion, three hundred billion, two hundred three million, one hundred thirty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •