Base | Representation |
---|---|
bin | 1010000000010111100001… |
… | …0101110000001110110011 |
3 | 1102221201121120212001110211 |
4 | 2200011320111300032303 |
5 | 2420221412113313210 |
6 | 35221553130004551 |
7 | 2213553460614205 |
oct | 240057025601663 |
9 | 42851546761424 |
10 | 11001430213555 |
11 | 3561753604591 |
12 | 1298198876757 |
13 | 61a579820a72 |
14 | 2a06874b0775 |
15 | 14128c01b38a |
hex | a01785703b3 |
11001430213555 has 8 divisors (see below), whose sum is σ = 13214957702832. Its totient is φ = 8792316539808.
The previous prime is 11001430213531. The next prime is 11001430213577. The reversal of 11001430213555 is 55531203410011.
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 11001430213555 - 227 = 11001295995827 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 1103448397 + ... + 1103458366.
It is an arithmetic number, because the mean of its divisors is an integer number (1651869712854).
Almost surely, 211001430213555 is an apocalyptic number.
11001430213555 is a deficient number, since it is larger than the sum of its proper divisors (2213527489277).
11001430213555 is an equidigital number, since it uses as much as digits as its factorization.
11001430213555 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2206907765.
The product of its (nonzero) digits is 9000, while the sum is 31.
Adding to 11001430213555 its reverse (55531203410011), we get a palindrome (66532633623566).
The spelling of 11001430213555 in words is "eleven trillion, one billion, four hundred thirty million, two hundred thirteen thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •