Base | Representation |
---|---|
bin | 1001000110110101110111… |
… | …1101000011100000100111 |
3 | 1022110020200021222010220110 |
4 | 2101231131331003200213 |
5 | 2303023410113200343 |
6 | 33143550401104103 |
7 | 2052266032426524 |
oct | 221553575034047 |
9 | 38406607863813 |
10 | 10013145053223 |
11 | 3210607382074 |
12 | 1158746028033 |
13 | 57830a5b6620 |
14 | 2688d2c5614b |
15 | 1256e8e98833 |
hex | 91b5df43827 |
10013145053223 has 32 divisors (see below), whose sum is σ = 14784041664000. Its totient is φ = 5988250014336.
The previous prime is 10013145053213. The next prime is 10013145053237. The reversal of 10013145053223 is 32235054131001.
It is not a de Polignac number, because 10013145053223 - 29 = 10013145052711 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10013145053213) 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 31 ways as a sum of consecutive naturals, for example, 2924673 + ... + 5346026.
It is an arithmetic number, because the mean of its divisors is an integer number (462001302000).
Almost surely, 210013145053223 is an apocalyptic number.
10013145053223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
10013145053223 is a deficient number, since it is larger than the sum of its proper divisors (4770896610777).
10013145053223 is a wasteful number, since it uses less digits than its factorization.
10013145053223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8271591.
The product of its (nonzero) digits is 10800, while the sum is 30.
Adding to 10013145053223 its reverse (32235054131001), we get a palindrome (42248199184224).
The spelling of 10013145053223 in words is "ten trillion, thirteen billion, one hundred forty-five million, fifty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •