Base | Representation |
---|---|
bin | 1001011111010110100100… |
… | …1011101110100111111111 |
3 | 1100221111121010212020202122 |
4 | 2113311221023232213333 |
5 | 2331423311000303343 |
6 | 34105231312313155 |
7 | 2124564125461235 |
oct | 227655113564777 |
9 | 40844533766678 |
10 | 10434240244223 |
11 | 3363155663714 |
12 | 1206285b427bb |
13 | 5a8c384883b3 |
14 | 28103c94a955 |
15 | 131642844068 |
hex | 97d692ee9ff |
10434240244223 has 4 divisors (see below), whose sum is σ = 10434806141520. Its totient is φ = 10433674346928.
The previous prime is 10434240244159. The next prime is 10434240244231. The reversal of 10434240244223 is 32244204243401.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10434240244223 - 26 = 10434240244159 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10434240244423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 282920990 + ... + 282957867.
It is an arithmetic number, because the mean of its divisors is an integer number (2608701535380).
Almost surely, 210434240244223 is an apocalyptic number.
10434240244223 is a deficient number, since it is larger than the sum of its proper divisors (565897297).
10434240244223 is an equidigital number, since it uses as much as digits as its factorization.
10434240244223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 565897296.
The product of its (nonzero) digits is 147456, while the sum is 35.
Adding to 10434240244223 its reverse (32244204243401), we get a palindrome (42678444487624).
The spelling of 10434240244223 in words is "ten trillion, four hundred thirty-four billion, two hundred forty million, two hundred forty-four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •