Base | Representation |
---|---|
bin | 1010000000111000100100… |
… | …0101101010010011001111 |
3 | 1102222120111211001220220110 |
4 | 2200032021011222103033 |
5 | 2420343044043022343 |
6 | 35230021300451103 |
7 | 2214316345353045 |
oct | 240161105522317 |
9 | 42876454056813 |
10 | 11010301142223 |
11 | 3565495a58599 |
12 | 1299a536a9a93 |
13 | 61b36161c196 |
14 | 2a0c896c8395 |
15 | 14160abee833 |
hex | a038916a4cf |
11010301142223 has 16 divisors (see below), whose sum is σ = 15152046111360. Its totient is φ = 7108092204576.
The previous prime is 11010301142209. The next prime is 11010301142227. The reversal of 11010301142223 is 32224110301011.
It is not a de Polignac number, because 11010301142223 - 28 = 11010301141967 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11010301142223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11010301142227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 464205240 + ... + 464228957.
It is an arithmetic number, because the mean of its divisors is an integer number (947002881960).
Almost surely, 211010301142223 is an apocalyptic number.
11010301142223 is a deficient number, since it is larger than the sum of its proper divisors (4141744969137).
11010301142223 is an equidigital number, since it uses as much as digits as its factorization.
11010301142223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 928434326.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 11010301142223 its reverse (32224110301011), we get a palindrome (43234411443234).
The spelling of 11010301142223 in words is "eleven trillion, ten billion, three hundred one million, one hundred forty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •