Base | Representation |
---|---|
bin | 1001011010000111100100… |
… | …0011100011000111111011 |
3 | 1100121220110220102101212102 |
4 | 2112201321003203013323 |
5 | 2323440122412102303 |
6 | 34000040022534015 |
7 | 2115231462060101 |
oct | 226417103430773 |
9 | 40556426371772 |
10 | 10344312222203 |
11 | 3328aa8634763 |
12 | 11b096929730b |
13 | 5a060654804b |
14 | 27a94b427c71 |
15 | 12e12c984288 |
hex | 968790e31fb |
10344312222203 has 4 divisors (see below), whose sum is σ = 10379617042368. Its totient is φ = 10309007402040.
The previous prime is 10344312222151. The next prime is 10344312222281. The reversal of 10344312222203 is 30222221344301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10344312222203 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10344312228203) 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 in 3 ways as a sum of consecutive naturals, for example, 17652409643 + ... + 17652410228.
It is an arithmetic number, because the mean of its divisors is an integer number (2594904260592).
Almost surely, 210344312222203 is an apocalyptic number.
10344312222203 is a deficient number, since it is larger than the sum of its proper divisors (35304820165).
10344312222203 is an equidigital number, since it uses as much as digits as its factorization.
10344312222203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35304820164.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 10344312222203 its reverse (30222221344301), we get a palindrome (40566533566504).
The spelling of 10344312222203 in words is "ten trillion, three hundred forty-four billion, three hundred twelve million, two hundred twenty-two thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •