Base | Representation |
---|---|
bin | 1001000111010111011001… |
… | …0101011000111111000111 |
3 | 1022111002220110010001011221 |
4 | 2101311312111120333013 |
5 | 2303200322332123143 |
6 | 33152035344141211 |
7 | 2053035033406513 |
oct | 221656625307707 |
9 | 38432813101157 |
10 | 10022144020423 |
11 | 3214405028347 |
12 | 115a437907807 |
13 | 579112a947a2 |
14 | 26910807d143 |
15 | 125a7401e2ed |
hex | 91d76558fc7 |
10022144020423 has 8 divisors (see below), whose sum is σ = 10197106177280. Its totient is φ = 9848384353080.
The previous prime is 10022144020387. The next prime is 10022144020463. The reversal of 10022144020423 is 32402044122001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10022144020423 - 221 = 10022141923271 is a prime.
It is a super-2 number, since 2×100221440204232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10022144020463) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 300605565 + ... + 300638902.
It is an arithmetic number, because the mean of its divisors is an integer number (1274638272160).
Almost surely, 210022144020423 is an apocalyptic number.
10022144020423 is a deficient number, since it is larger than the sum of its proper divisors (174962156857).
10022144020423 is an equidigital number, since it uses as much as digits as its factorization.
10022144020423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 601244757.
The product of its (nonzero) digits is 3072, while the sum is 25.
Adding to 10022144020423 its reverse (32402044122001), we get a palindrome (42424188142424).
The spelling of 10022144020423 in words is "ten trillion, twenty-two billion, one hundred forty-four million, twenty thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •