Base | Representation |
---|---|
bin | 1010000000111010110001… |
… | …0101001101011001000001 |
3 | 1102222122001000122222110022 |
4 | 2200032230111031121001 |
5 | 2420400301424430143 |
6 | 35230200101543225 |
7 | 2214340115215655 |
oct | 240165425153101 |
9 | 42878030588408 |
10 | 11010892420673 |
11 | 3565769799872 |
12 | 1299b99714b15 |
13 | 61b426c830a2 |
14 | 2a0d04040a65 |
15 | 141642a98268 |
hex | a03ac54d641 |
11010892420673 has 2 divisors, whose sum is σ = 11010892420674. Its totient is φ = 11010892420672.
The previous prime is 11010892420637. The next prime is 11010892420709. The reversal of 11010892420673 is 37602429801011.
Together with previous prime (11010892420637) it forms an Ormiston pair, because they use the same digits, order apart.
It is a balanced prime because it is at equal distance from previous prime (11010892420637) and next prime (11010892420709).
It can be written as a sum of positive squares in only one way, i.e., 10450659631504 + 560232789169 = 3232748^2 + 748487^2 .
It is a cyclic number.
It is not a de Polignac number, because 11010892420673 - 28 = 11010892420417 is a prime.
It is not a weakly prime, because it can be changed into another prime (11010892420273) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505446210336 + 5505446210337.
It is an arithmetic number, because the mean of its divisors is an integer number (5505446210337).
Almost surely, 211010892420673 is an apocalyptic number.
It is an amenable number.
11010892420673 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010892420673 is an equidigital number, since it uses as much as digits as its factorization.
11010892420673 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 145152, while the sum is 44.
The spelling of 11010892420673 in words is "eleven trillion, ten billion, eight hundred ninety-two million, four hundred twenty thousand, six hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •