Base | Representation |
---|---|
bin | 1001001100000101011011… |
… | …1101010101111001100101 |
3 | 1022202212011220122012212211 |
4 | 2103001112331111321211 |
5 | 2311012344313020003 |
6 | 33253204530443421 |
7 | 2061635155025413 |
oct | 223012675257145 |
9 | 38685156565784 |
10 | 10103222001253 |
11 | 324583047a377 |
12 | 11720a4733571 |
13 | 58396433aa84 |
14 | 26cdda0642b3 |
15 | 127c1be7496d |
hex | 93056f55e65 |
10103222001253 has 2 divisors, whose sum is σ = 10103222001254. Its totient is φ = 10103222001252.
The previous prime is 10103222001241. The next prime is 10103222001349. The reversal of 10103222001253 is 35210022230101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5689932788164 + 4413289213089 = 2385358^2 + 2100783^2 .
It is a cyclic number.
It is not a de Polignac number, because 10103222001253 - 29 = 10103222000741 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10103222001203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5051611000626 + 5051611000627.
It is an arithmetic number, because the mean of its divisors is an integer number (5051611000627).
Almost surely, 210103222001253 is an apocalyptic number.
It is an amenable number.
10103222001253 is a deficient number, since it is larger than the sum of its proper divisors (1).
10103222001253 is an equidigital number, since it uses as much as digits as its factorization.
10103222001253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720, while the sum is 22.
Adding to 10103222001253 its reverse (35210022230101), we get a palindrome (45313244231354).
The spelling of 10103222001253 in words is "ten trillion, one hundred three billion, two hundred twenty-two million, one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •