Base | Representation |
---|---|
bin | 1001100101101111101010… |
… | …0011101101110110010111 |
3 | 1101100000001012201010102222 |
4 | 2121123322203231312113 |
5 | 2340223210133124343 |
6 | 34231512105452555 |
7 | 2135532321134123 |
oct | 231337243556627 |
9 | 41300035633388 |
10 | 10544053411223 |
11 | 33a57872a4392 |
12 | 12236121a115b |
13 | 5b63b905b217 |
14 | 286498db8583 |
15 | 13441d333a68 |
hex | 996fa8edd97 |
10544053411223 has 8 divisors (see below), whose sum is σ = 10664004034992. Its totient is φ = 10424332359936.
The previous prime is 10544053411219. The next prime is 10544053411247. The reversal of 10544053411223 is 32211435044501.
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 10544053411223 - 22 = 10544053411219 is a prime.
It is a super-2 number, since 2×105440534112232 (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 (10544056411223) 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, 57300740 + ... + 57484457.
It is an arithmetic number, because the mean of its divisors is an integer number (1333000504374).
Almost surely, 210544053411223 is an apocalyptic number.
10544053411223 is a deficient number, since it is larger than the sum of its proper divisors (119950623769).
10544053411223 is an equidigital number, since it uses as much as digits as its factorization.
10544053411223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114786241.
The product of its (nonzero) digits is 57600, while the sum is 35.
Adding to 10544053411223 its reverse (32211435044501), we get a palindrome (42755488455724).
The spelling of 10544053411223 in words is "ten trillion, five hundred forty-four billion, fifty-three million, four hundred eleven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •