Base | Representation |
---|---|
bin | 1001010011000101010010… |
… | …0100111000101111010101 |
3 | 1100012100111012010020002022 |
4 | 2110301110210320233111 |
5 | 2320000101411321323 |
6 | 33424330051422525 |
7 | 2103422254464536 |
oct | 224612444705725 |
9 | 40170435106068 |
10 | 10223441120213 |
11 | 3291811a95842 |
12 | 11914558b4a45 |
13 | 5920b2a44819 |
14 | 274b6252868d |
15 | 12ae062ae4c8 |
hex | 94c54938bd5 |
10223441120213 has 2 divisors, whose sum is σ = 10223441120214. Its totient is φ = 10223441120212.
The previous prime is 10223441120203. The next prime is 10223441120261. The reversal of 10223441120213 is 31202114432201.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7835111962129 + 2388329158084 = 2799127^2 + 1545422^2 .
It is a cyclic number.
It is not a de Polignac number, because 10223441120213 - 212 = 10223441116117 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10223441120203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5111720560106 + 5111720560107.
It is an arithmetic number, because the mean of its divisors is an integer number (5111720560107).
Almost surely, 210223441120213 is an apocalyptic number.
It is an amenable number.
10223441120213 is a deficient number, since it is larger than the sum of its proper divisors (1).
10223441120213 is an equidigital number, since it uses as much as digits as its factorization.
10223441120213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 10223441120213 its reverse (31202114432201), we get a palindrome (41425555552414).
The spelling of 10223441120213 in words is "ten trillion, two hundred twenty-three billion, four hundred forty-one million, one hundred twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •