Base | Representation |
---|---|
bin | 1001011000001000100111… |
… | …0110101111111111010101 |
3 | 1100111122111221212200120111 |
4 | 2112002021312233333111 |
5 | 2322410324442410313 |
6 | 33532242315403021 |
7 | 2112614134625533 |
oct | 226021166577725 |
9 | 40448457780514 |
10 | 10310234341333 |
11 | 3315600553453 |
12 | 11a6238753471 |
13 | 59a3353938b4 |
14 | 279037595153 |
15 | 12d2d5d4e43d |
hex | 96089daffd5 |
10310234341333 has 2 divisors, whose sum is σ = 10310234341334. Its totient is φ = 10310234341332.
The previous prime is 10310234341327. The next prime is 10310234341369. The reversal of 10310234341333 is 33314343201301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10209673686564 + 100560654769 = 3195258^2 + 317113^2 .
It is a cyclic number.
It is not a de Polignac number, because 10310234341333 - 213 = 10310234333141 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10310234341295 and 10310234341304.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10310234341933) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5155117170666 + 5155117170667.
It is an arithmetic number, because the mean of its divisors is an integer number (5155117170667).
Almost surely, 210310234341333 is an apocalyptic number.
It is an amenable number.
10310234341333 is a deficient number, since it is larger than the sum of its proper divisors (1).
10310234341333 is an equidigital number, since it uses as much as digits as its factorization.
10310234341333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 31.
Adding to 10310234341333 its reverse (33314343201301), we get a palindrome (43624577542634).
The spelling of 10310234341333 in words is "ten trillion, three hundred ten billion, two hundred thirty-four million, three hundred forty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •